def gcf(numbers):
    divisor = min(numbers)
    while True:
        isOk = True
        for number in numbers:
            if number % divisor != 0:
                isOk = False
                break

        if isOk:
            break
        else:
            divisor -= 1
    return divisor


print(gcf([10, 20, 35]))