n = int(input())
numbers = [int(x) for x in input().split()]
while True:
x = numbers.index(ma := max(numbers))
y = numbers.index(mi := min(numbers))
if x != y:
numbers[x] = ma - mi
else:
break
print(sum(numbers))
#include<bits/stdc++.h>
#define ll long long
#define mod (int)1e9+7
using namespace std;
// Code By VibhuGodson
ll gcd(ll a,ll b){
return __gcd(a,b);
}
int main(){
ll t=1;
// cin>>t;
while(t--){
ll n;
cin>>n;
ll x;
ll m=n;
n--;cin>>x;
ll y;
while(n--) {cin>>y;x=gcd(x,y);}
cout<<m*x<<endl;
}
return 0;
}
1666L - Labyrinth | 1294B - Collecting Packages |
1642B - Power Walking | 1424M - Ancient Language |
600C - Make Palindrome | 1669D - Colorful Stamp |
1669B - Triple | 1669A - Division |
1669H - Maximal AND | 1669E - 2-Letter Strings |
483A - Counterexample | 3C - Tic-tac-toe |
1669F - Eating Candies | 1323B - Count Subrectangles |
991C - Candies | 1463A - Dungeon |
1671D - Insert a Progression | 1671A - String Building |
1671B - Consecutive Points Segment | 1671C - Dolce Vita |
1669G - Fall Down | 4D - Mysterious Present |
1316B - String Modification | 1204A - BowWow and the Timetable |
508B - Anton and currency you all know | 1672A - Log Chopping |
300A - Array | 48D - Permutations |
677C - Vanya and Label | 1583B - Omkar and Heavenly Tree |