Find GCD (HCF) of two numbers using Euclid's algorithm recursively.

Difficulty: Medium

Phase: 3 · Recursion

XP Reward: 20 XP

Topics: Recursion, Medium

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given two positive integers A and B on separate lines, compute their GCD using Euclid's recursive algorithm. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 48 18

Output: 6

Explanation: Sample execution for input 48 18