# Euclid's algorithm for GCD
# assume m <= n

def nonrec_gcd(m,n):
    #assume m<=n
    while m != 0:
        n, m = m, n % m     # % is remainder operator
    return n

def gcd(m,n):
    print "m = ", m, "  n = ", n 
    if m == 0:
        return n
    return gcd(n%m, m)

if __name__ == "__main__":
    print gcd(408,1440)
    print gcd(6765, 10945)