#823. Recursion: GCD
You get a and b. Find their greatest common divisor (GCD) with a recursive function.
### Input
a b (1 ≤ a, b ≤ 10⁹).
### Output
Answer.
Examples
Input
3050394 1411540
Output
2
Input
716208 1033724
Output
4
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.