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).
'''input
2
1 2
'''





n = int(input())

l = list(map(int, input().split()))
 
global minE
minE = min(l)


def minimize(minE):
	o = False
	currMin = minE
	for i in range(n):
		if l[i] > minE:
			if l[i]%minE == 0:
				k = l[i] - (l[i]/minE - 1)*minE
				l[i] = k
				if currMin > k:
					currMin = k
			else:
				k = l[i] - (l[i]//minE)*minE
				l[i] = k
				if currMin > k:
					currMin = k

			o = True


	if(o):
		minimize(currMin)
	else:
		return


x = minimize(minE)


print(int(sum(l)))




















