codeforce389A

很明显的贪心题 所以就不过多的分析了

每次都用最大值减去最小值 就可得到最优解

A. Fox and Number Game

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>
#define N 100
using namespace std;
int a[N];
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=0;i<n;i++)
            cin>>a[i];
            sort(a,a+n,cmp);
            while(a[0]>a[n-1])
            {
                a[0]-=a[n-1];
                sort(a,a+n,cmp);
            }
            int sum=0;
        for(int i=0;i<n;i++)
        {
            sum+=a[i];
        }
        cout<<sum<<endl;
    }
    return 0;
}