Problem:
Score : 300 points

Problem Statement

We have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.

Initially, the hand of every clock stands still, pointing directly upward.

Now, Dolphin starts all the clocks simultaneously.

In how many seconds will the hand of every clock point directly upward again?

Constraints

1≤N≤100

1≤T_i≤10^{18}

All input values are integers.

The correct answer is at most 10^{18} seconds.

Input

Input is given from Standard Input in the following format:

N
T_1
:
T_N

Output

Print the number of seconds after which the hand of every clock point directly upward again.

Sample Input 1

2
2
3

Sample Output 1

6

We have two clocks. The time when the hand of each clock points upward is as follows:

Clock 1: 2, 4, 6, ... seconds after the beginning

Clock 2: 3, 6, 9, ... seconds after the beginning

Therefore, it takes 6 seconds until the hands of both clocks point directly upward.

Sample Input 2

5
2
5
10
1000000000000000000
1000000000000000000

Sample Output 2

1000000000000000000

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
namespace kozaiyApp
{
    public class MultipleClocks
    {
        static void Main()
        {
            ulong N = ulong.Parse(Console.ReadLine());
            ulong[] T = new ulong[N];

            ulong m = ulong.Parse(Console.ReadLine());
            ulong n;

            // 最小公倍数を求めていく
            for (ulong i = 0; i < N - 1; i++)
            {
                n = ulong.Parse(Console.ReadLine());
                m = LeastCommonMultiple(m, n);
            }

            Console.WriteLine(m);
        }

        // 最大公約数 m > n ユークリッドの互除法 
        public static ulong GreatestCommonDivisor(ulong m, ulong n)
        {
            ulong i;
            while (m % n != 0)
            {
                i = n;
                n = m % n;
                m = i;
            }
            return n;
        }

        // 最小公倍数 m > n
        public static ulong LeastCommonMultiple(ulong m, ulong n)
        {
            return m / GreatestCommonDivisor(m, n) * n;
        }
    }
}