codeforces 389A Fox and Number Game

                                                                                                      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 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₁, x₂, ..., x_n (1 ≤ x_i ≤ 100).

Output

Output a single integer — the required minimal sum.

Sample test(s)

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₁.

直接暴力就行

代码：

#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int a,int b)
{
    if(b==0) return a;
    return gcd(b,a%b);
}
int main()
{
    int a[110];
    int n;
    while(cin>>n)
    {
        for(int i=0;i<n;i++)
        cin>>a[i];
        sort(a,a+n);
        int ans=a[0];
        for(int i=1;i<n;i++)
        {
            ans=gcd(ans,a[i]);
        }
        cout<<ans*n<<endl;
    }
    return 0;
}