B'Fox Ciel is playing a game with numbers now. Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i and j such that xi > xj hold, and then apply assignment xi = xi - xj. 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100). Then the second line contains n integers: x1, x2, ..., xn (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100). Output a single integer -- the required minimal sum. In the first example the optimal way is to do the assignment: x2 = x2 - x1. In the second example the optimal sequence of operations is: x3 = x3 - x2, x2 = x2 - x1.'...