Fox Ciel is playing a game with numbers now. 

Ciel has *n* positive integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub>. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x*<sub class="lower-index">*i*</sub> &gt; *x*<sub class="lower-index">*j*</sub> hold, and then apply assignment *x*<sub class="lower-index">*i*</sub> = *x*<sub class="lower-index">*i*</sub> - *x*<sub class="lower-index">*j*</sub>. The goal is to make the sum of all numbers as small as possible.

Please help Ciel to find this minimal sum.
The first line contains an integer *n* (2 ≤ *n* ≤ 100). Then the second line contains *n* integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 100).
#include <bits/stdc++.h>

using namespace std;

int n;
int arr[105];

int main()
{
    cin >> n;
    int i;
    for(i=0;i<n;i++)
        cin >> arr[i];
    while(arr[0]!=arr[n-1])
    {
        sort(arr,arr+n);
        for(i=0;i<n;i++)
        {
            if(arr[i]>arr[i-1])
            {
                arr[i]=arr[i]-arr[i-1];
            }
        }
    }
    cout << arr[0]*n << endl;
}
