def gcd_enum(x, y):
    min_num = min(x, y)
    for i in range(min_num, , -1):
        if x % i ==  and y % i == :
            return i

def gcd_enum(x, y):
    max_num = max(x, y)
    for i in range(1, max_num):
        if x % i ==  and y % i == :
            return i

def gcd_enum(x, y):
    for i in range(min(x, y), ):
        if x % i ==  or y % i == :
            return i

def gcd_enum(x, y):
    i = min(x, y)
    while i > :
        if x % i ==  and y % i == :
            break
    return i