Codeforces Round #228 (Div. 2) A. Fox and Number Game

　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　A. Fox and Number Game

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Fox Ciel is playing a game with numbers now.

Ciel has n positive integers: x₁, x₂, ..., x_n. She can do the following operation as many times as needed: select two different indexes i and jsuch 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₁, x₂, ..., x_n (1 ≤ x_i ≤ 100).

Output

Output a single integer — the required minimal sum.

Examples

input

2
1 2

output

2

input

3
2 4 6

output

6

input

2
12 18

output

12

input

5
45 12 27 30 18

output

15

Note

In the first example the optimal way is to do the assignment: x₂ = x₂ - x₁.

In the second example the optimal sequence of operations is: x₃ = x₃ - x₂, x₂ = x₂ - x₁.

题意：给出n个数字，问任意2个数，如果ai>aj,那么ai=ai-aj。问最后最少总和是多少

思路：就是求最大公约数*n

#include<bits/stdc++.h>
using namespace std;

int a[102];
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=2;i<=n;i++){
        a[i]=__gcd(a[i],a[i-1]);
    }
    cout<<a[n]*n<<endl;
}