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: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes iand j such that xi > xj hold, and then apply assignment xi = xi - xj. 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: x1, x2, ..., xn (1 ≤ xi ≤ 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: x2 = x2 - x1.

In the second example the optimal sequence of operations is: x3 = x3 - x2, x2 = x2 - x1.

解题报告：

此题就是连续排序，然后每两个大的相减，然后重复排序，直到减到全部相同即可。代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int s[111];
int main(){
    int t;
    scanf("%d",&t);
    for(int i=0;i<t;i++)
        scanf("%d",&s[i]);
    sort(s,s+t);
    while(true){
        for(int i=t-1;i>=1;i--)
            if(s[i]>s[i-1])
                s[i]=s[i]-s[i-1];
        sort(s,s+t);
        if(s[0]==s[t-1]){
            printf("%d\n",t*s[0]);break;
        }
    }
    return 0;
}