#T346. 求最大公约数问题

求最大公约数问题

Description

Given two positive integers, find their greatest common divisor (GCD).

Input Format

The input consists of one line containing two positive integers (<1,000,000,000).

Output Format

Output a single positive integer, which is the GCD of the two given integers.

6 9

3