# Recursive function to return gcd of a and b 
def gcd(a,b): 
	
	# Everything divides 0 
	if (b == 0): 
		return a 
	return gcd(b, a%b) 

# Driver program to test above function 
a = 98
b = 56
if(gcd(a, b)): 
	print('GCD of', a, 'and', b, 'is', gcd(a, b)) 
else: 
	print('not found') 

# This code is contributed by Danish Raza 

2684a9a8e6e293d30e476a67433b80aad1602bfc
<mask token>

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


<mask token>

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


<mask token>
if gcd(a, b):
    print('GCD of', a, 'and', b, 'is', gcd(a, b))
else:
    print('not found')

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


a = 98
b = 56
if gcd(a, b):
    print('GCD of', a, 'and', b, 'is', gcd(a, b))
else:
    print('not found')

# Recursive function to return gcd of a and b 
def gcd(a,b): 
	
	# Everything divides 0 
	if (b == 0): 
		return a 
	return gcd(b, a%b) 

# Driver program to test above function 
a = 98
b = 56
if(gcd(a, b)): 
	print('GCD of', a, 'and', b, 'is', gcd(a, b)) 
else: 
	print('not found') 

# This code is contributed by Danish Raza 
