PROGRAMMING:Recursive function for finding the maximum divisor by Division

Write a function. The formal parameters of the function are two positive integers a and B. the function returns the greatest common divisor of a and B, which requires recursion. The main function inputs two integers m and N and outputs the greatest common divisor of M and n.
###Input example:
```in
36 24
```
###Output example:
```out
twelve
```







answer：If there is no answer, please comment