Fox and Number Game CodeForces - 389A（gcd应用）

Fox and Number Game

 CodeForces - 389A

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 i and 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 nintegers: x1, x2, ..., xn (1 ≤ xi ≤ 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: x2 = x2 - x1.

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

题意:给出n个数，选取两个数，将较大的数替换为两数的差（大减小），如此往复，直到所有数都相等，求此时数列的和

思路：刚开始排序暴力果断TL，正确思路是：由数学中的更相减损术可以知道，两个数一直作差运算，最后一定是相等的，并且最后这个数为原来的两个数的最大公约数。那么问题中的n个数要使其和最小，就必须作很多次差运算，直至最后所有数全部相等。那么就可以知道最后这个数为这n个数的最大公约数，从而问题转化为求这n个数的最大公约数，最后将它们的最大公约数乘以n即为答案。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<utility>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#define maxn 100005
#define INF 0x3f3f3f3f
#define LL long long
#define ULL unsigned long long
#define E 1e-8
#define mod 1000000007
#define P pair<int,int>
#define MID(l,r) (l+(r-l)/2)
#define lson(o) (o<<1)
#define rson(o) (o<<1|1)
using namespace std;

int gcd(int a,int b)
{
    return b?gcd(b,a%b):a;
}
int main()
{
    int n,x;
    while(scanf("%d",&n)!=EOF){
        int ans = 0,cnt = n;
        while(n--){
            scanf("%d",&x);
            ans = gcd(ans,x);
        }
        printf("%d\n",ans*cnt);
    }
    return 0;
}