//
// ABC070C
// URL : https://atcoder.jp/contests/abc070/tasks/abc070_c
// 
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;

namespace AtCoder
{
    class ABC070C
    {
        static void Main(string[] args)
        {
            preprocess();

            // 整数の入力
            long N = long.Parse(Console.ReadLine());

            var TList = new Dictionary<int, ulong>((int)N);
            int cnt = 0;
            for(int i = 0; i < N; ++i)
            {
                ulong x = ulong.Parse(Console.ReadLine());
                //重複を含めない
                if (TList.ContainsValue(x) == false)
                {
                    TList.Add(cnt, x);
                    cnt++;
                }
            }
            var ans = Solve(TList);

            Console.WriteLine(ans.ToString());
            Console.Out.Flush();
        }

        static ulong Solve(Dictionary<int, ulong> TList)
        {
            //TListにある数の最小公倍数を求める
            ulong ans = TList[0];
            for(int i = 1; i < TList.Count; ++i)
            {
                ans = Lcm(ans, TList[i]);
            }
            return ans;
        }

        //---------------------------------------------------------------------------------
        /// <summary>
        /// 
        /// </summary>
        public static void preprocess()
        {
            //出力高速化
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);
        }


        /// <summary>
        /// 与えられた数が素数かどうかを計算する
        /// </summary>
        /// <param name="num">対象数</param>
        /// <returns>true:素数, false:素数ではない(合成数)</returns>
        public static bool isPrime(int num)
        {
            if (num < 2) return false;
            else if (num == 2) return true;
            else if (num % 2 == 0) return false;

            double sqrtNum = Math.Sqrt(num);
            for (int i = 3; i <= sqrtNum; i += 2)
            {
                if (num % i == 0)
                {
                    return false;
                }
            }
            return true;
        }

        /// <summary>
        /// 順列mPnを計算する
        /// </summary>
        /// <param name="m"></param>
        /// <param name="n"></param>
        /// <returns></returns>
        public static long Permutation(long m, long n)
        {
            long ret = 1;
            for(var i = 0; i < n; ++i)
            {
                ret *= m - i;
            }
            return ret;
        }
        /// <summary>
        /// 組み合わせmCnを計算する
        /// </summary>
        /// <param name="m"></param>
        /// <param name="n"></param>
        /// <returns></returns>
        public static long Combination(long m, long n)
        {
            if(m == n || n == 0)
            {
                return 1;
            }
            long ans = 1;
            for(var i = 0; i <= n; ++i)
            {
                ans *= (m - i + 1) / i;
            }
            return ans;
        }

        static ulong Gcd(ulong m, ulong n)
        {
            if (n == 0) return m;
            return Gcd(n, m % n);
        }

        static ulong Lcm(ulong m, ulong n)
        {
            var gcd = Gcd(m, n);
            //return (m * n) / gcd;
            return m / gcd * n;//桁あふれ対策
        }
    }
}



Measured memory_bytes: 13152