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 iand 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>
using namespace std;
#include <algorithm>
#include <cstdio>
#include <cstring>
int stu[110];
int t;
int main()
{
    int i;
    while(~scanf("%d",&t))
    {
        for(i=1;i<=t;++i)
        {
            scanf("%d",&stu[i]);
        }
        sort(stu+1,stu+t+1);
        while(1)
        {
            for(i=t;i>=2;--i)
           {
              if(stu[i]>stu[i-1])
              {
                stu[i]=stu[i]-stu[i-1];
              }
           }
              sort(stu+1,stu+t+1);
            if(stu[1]==stu[t])
           {
            printf("%d\n",t*stu[1]);break;
           }
        }
    }
    return 0;
}