Problem Statement

Snuke had $N$ cards numbered $1$ through $N$. Each card has an integer written on it; written on Card $i$ is ai​.

Snuke did the following procedure:

1. Let $X$ and $x$ be the maximum and minimum values written on Snuke's cards, respectively.
2. If $X=x$, terminate the procedure. Otherwise, replace each card on which $X$ is written with a card on which $X-x$ is written, then go back to step 1.

Under the constraints in this problem, it can be proved that the procedure will eventually terminate. Find the number written on all of Snuke's cards after the procedure.

Constraints

• All values in input are integers.
• 1≤N≤105
• 1≤ai​≤109

Sample Input 1

3
2 6 6

Sample Output 1

2

• At the beginning of the procedure, the numbers written on Snuke's cards are $(2,6,6)$.
  • Since $x=2$ and $X=6$, he replaces each card on which $6$ is written with a card on which $4$ is written.
• Now, the numbers written on Snuke's cards are $(2,4,4)$.
  • Since $x=2$ and $X=4$, he replaces each card on which $4$ is written with a card on which $2$ is written.
• Now, the numbers written on Snuke's cards are $(2,2,2)$.
  • Since $x=2$ and $X=2$, he terminates the procedure.

Sample Input 2

15
546 3192 1932 630 2100 4116 3906 3234 1302 1806 3528 3780 252 1008 588

Sample Output 2

42