#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

## Problem Description

The greatest common divisor of 2 numbers, also known as the highest common factor, is the highest whole number that can divide those 2 numbers without leaving any remainder.

The formula for GCD is as below: [Do note that a > b for all cases]

## Input

2 numbers, *a* and *b*. It is not guarenteed that *a* is always greater than *b* or vice versa. However, both numbers will be below 10^{9}

## Output

Output a single integer, the greatest common divisor of the 2 numbers.

## Sample Input

12 8

## Sample Output

4

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 100 | 10 | 1s | 32MB | Average |

2 | 0 | 1 | 1s | 32MB | Average |

### Judge Compile Command

g++-7 ans.cpp -o gcd -Wall -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512