Fox Ciel is playing a game with numbers now.

Ciel has $*n*$ positive integers: $*x*_{1}$, $*x*_{2}$, ..., $*x*_{*n*}$. She can do the following operation as many times as needed: select two different indexes $*i*$ and $*j*$ such that $*x*_{*i*}$ > $*x*_{*j*}$ hold, and then apply assignment $*x*_{*i*}$ = $*x*_{*i*}$ - $*x*_{*j*}$. The goal is to make the sum of all numbers as small as possible.

Please help Ciel to find this minimal sum.

Input

The first line contains an integer $*n*$ ($2 ≤ *n* ≤ 100$). Then the second line contains $*n*$ integers: $*x*_{1}$, $*x*_{2}$, ..., $*x*_{*n*}$ ($1 ≤ *x*_{*i*} ≤ 100$).

Output

Output a single integer — the required minimal sum.

Note

In the first example the optimal way is to do the assignment: $*x*_{2}$ = $*x*_{2}$ - $*x*_{1}$.

In the second example the optimal sequence of operations is: $*x*_{3}$ = $*x*_{3}$ - $*x*_{2}$, $*x*_{2}$ = $*x*_{2}$ - $*x*_{1}$.