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).
from math import gcd
from functools import reduce


def find_gcd(l):
    x = reduce(gcd, l)
    return x



class CodeforcesTask389ASolution:
    def __init__(self):
        self.result = ''
        self.n = 0
        self.nums = []

    def read_input(self):
        self.n = int(input())
        self.nums = [int(x) for x in input().split(" ")]

    def process_task(self):
        self.result = str(self.n * find_gcd(self.nums))

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask389ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
