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
5
45 12 27 30 18
'''
# I am Mr.Inconsistent 
from sys import stdin
import math


def equal(arr):
	c = arr[0]
	for i in range(len(arr)):
		if arr[i] != c:
			return False

	else:
		return True

# main starts
n = int(stdin.readline().strip())
arr = list(map(int, stdin.readline().split()))

while True:
	if equal(arr):
		break

	m = min(arr)
	for i in range(len(arr)):
		if arr[i] % m == 0:
			arr[i] = m
		else:
			arr[i] %= m
print(sum(arr))		