def gcd(a, b):
    '''
    Euclide algorithme
    Same as python's implementation of math.gcd
    '''
    while b:
        a, b = b, a % b
    return a


if __name__ == '__main__':
    print(gcd(9, 150))

e83e584736dcde5e5fa1792dcb9ee5f05644d178
<mask token>

def gcd(a, b):
    """
    Euclide algorithme
    Same as python's implementation of math.gcd
    """
    while b:
        a, b = b, a % b
    return a


<mask token>

def gcd(a, b):
    """
    Euclide algorithme
    Same as python's implementation of math.gcd
    """
    while b:
        a, b = b, a % b
    return a


if __name__ == '__main__':
    print(gcd(9, 150))

def gcd(a, b):
    '''
    Euclide algorithme
    Same as python's implementation of math.gcd
    '''
    while b:
        a, b = b, a % b
    return a


if __name__ == '__main__':
    print(gcd(9, 150))
