Write a program that inputs two numbers and output its' Greatest_common_divisor. You must write a recursive subroutine gcd to complete this task.
2467080 49360080
9240
Function can be like this: def nod(a,b): return a if b==0 else nod(b, a%b), but not on Python 
.