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).
# python 3
"""
"""


def fox_and_number_game(n_int: int, numbers_list: list) -> int:
    numbers_list.sort(reverse=True)
    while numbers_list[0] > numbers_list[-1]:
        largest_2nd_idx = 1
        while numbers_list[0] == numbers_list[largest_2nd_idx]:
            largest_2nd_idx += 1
        numbers_list[0] = numbers_list[0] - numbers_list[largest_2nd_idx]
        numbers_list.sort(reverse=True)
    return sum(numbers_list)


if __name__ == "__main__":
    """
    Inside of this is the test. 
    Outside is the API
    """
    n = int(input())
    numbers = list(map(int, input().split()))
    print(fox_and_number_game(n, numbers))
