GCD of 'n' numbers using Python's built-in function 'reduce'

gcd_n_numbers.py

"GCD - Greatest Common Divisor"

def gcd(a, b):
  '''Returns GCD of 2 numbers.'''
    if not b:
        return a
    else:
        return gcd(b, a % b)


def gcd_n(numbers):
  '''Returns GCD of given n numbers.
  Argument: numbers - List of given numbers
  '''
    return reduce(lambda x, y: gcd(x, y), numbers)


user_input = raw_input("Insert space separated numbers: ")
numbers = [int(n) for n in user_input.split()]
print "GCD of given numbers is %g" % (gcd_n(numbers))