Greatest Common Divisor

You are given two positive integers \(x\) and \(y\). Your task is to compute their greatest common divisor (GCD), which is the largest positive integer that divides both \(x\) and \(y\) without leaving a remainder.

The mathematical definition is given by:

$$\gcd(x,y)=\max\{d \in \mathbb{N} : d\mid x \text{ and } d\mid y\}$$

Use the standard algorithms or built-in functions in your chosen language to solve the problem.

inputFormat

The input consists of a single line containing two space-separated positive integers \(x\) and \(y\).

outputFormat

Output a single integer, which is the greatest common divisor of \(x\) and \(y\).

15 30

15