finding gcd with the euclidean algorithm

gcd.py

def gcd(a, b):
    if (a == 1 or b == 1):
        return 1
    elif (a == 0): return b
    elif (b == 0): return a
    else:
        # print(a, b)
        return gcd(b, a % b)


def main():
    to_continue = True
    while (to_continue):
        a = input("a: ")
        b = input("b: ")
        print(gcd(int(a), int(b)))

        to_continue = True if (input("continue? [Y/n] ") == ("y" or "Y")) else False


if __name__ == "__main__":
    main()