Problem:
Least Common Multiple

Find the least common multiple (LCM) of given n integers.

Input

n
a1 a2 ... an

n is given in the first line. Then, n integers are given in the second line.

Output

Print the least common multiple of the given integers in a line.

Constraints

2 ≤ n ≤ 10

1 ≤ ai ≤ 1000

Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1

Sample Input 1

3
3 4 6

Sample Output 1

12

Sample Input 2

4
1 2 3 5

Sample Output 2

30

Solution in C# (judge verdict: Accepted)

using System;

namespace NTL_1_C_Least_Common_Multiple
{
	class Program
	{
		static void Main ( string[] args )
		{
			int inputCount = int.Parse (Console.ReadLine ());
			int[] numArray = Array.ConvertAll (Console.ReadLine ().Split (' '), int.Parse);

			int lcm = LeastCommonMultiple (numArray[0], numArray[1]);

			for (int lp = 2; lp < inputCount; lp++)
			{
				lcm = LeastCommonMultiple (lcm, numArray[lp]);
			}

			Console.WriteLine (lcm);
		}

		static int GreatestCommonDivisor ( int divided, int divisor )
		{
			int mod;

			while ((mod = divided % divisor) != 0)
			{
				divided = divisor;
				divisor = mod;
			}

			return divisor;
		}

		static int LeastCommonMultiple ( int num1, int num2 )
		{
			if (num1 < num2)
			{
				int tmp = num1;
				num1 = num2;
				num2 = tmp;
			}

			return num1 * num2 / GreatestCommonDivisor (num1, num2);
		}
	}
}