Papa Carlo was making Buratino all his life. He made dozens, hundreds or maybe thousands of beautiful and well-dressed boys with long noses. Papa Carlo had a bunch of wooden sticks in his barn. He kept them for future noses. Last Friday Papa Carlo received an urgent order to produce batch of Buratino with the same noses. He decided to use all his wooden sticks for the noses. For this, Papa Carlo measured all sticks and found that their lengths are natural integers. Then, the Master began to choose arbitrary two sticks of different length and saw off the longer one by the length of the smaller one. As a result three sticks were turned out. All of these sticks were sent back to the pile. So Papa Carlo had been working until all the sticks in the pile became the same length. Help Papa Carlo and count the number of noses! Write a program that using the number of sticks \textbf{n} and their lengths \textbf{l_i} (\textbf{i} = \textbf{1}, ..., \textbf{n}) will determine the resulting number of noses. \textit{\textbf{Example}}. Let Papa Carlo has two sticks with the lengths of \textbf{4} cm and \textbf{6} cm. After the first sawing there will be three sticks: one \textbf{2 }cm stick and two \textbf{4} cm sticks. After the second sawing there will be four sticks with the lengths of \textbf{2}, \textbf{2}, \textbf{2} and \textbf{4} cm. Finally we will get five pieces of equal length \textbf{2} cm. \InputFile The first line contains an integer \textbf{n} (\textbf{1} ≤ \textbf{n} ≤ \textbf{10000}) -- number of nose sticks. In the following \textbf{n} lines \textbf{n} integers are given which are the lengths of sticks, one number per line (\textbf{1} ≤ \textbf{l}_i ≤\textbf{10000}; \textbf{1} ≤ \textbf{i} ≤ \textbf{n}). \OutputFile The output file should contain single integer \textbf{k} -- number of sticks in the pile by the end of Papa Carlo’s work.