#include<iostream>
#define f(i,n) for(register lli i=0;i<n;i++)
#define M 1000000007
using namespace std;
typedef long long int lli;
lli gcd(lli a, lli b)
{
lli t;
while (b)
{
t = a;
a = b;
b = t%b;
}
return a;
}
lli mod_of_lcm(lli a[],lli n)
{
lli ans=1;
f(i,n)
{
if(a[i]!=1)
{
for(lli j=i+1;j<n;j++)
{
a[j]/=gcd(a[i],a[j]);
//reducing all remaining numbers by thier gcd with currebt number
}
ans=(ans*a[i])%M;//mod
}
}
return ans;
}
int main()
{
int t=1;
lli n;
f(h,t)
{
cin>>n;
lli a[n];
f(i,n)
cin>>a[i];
cout<<mod_of_lcm(a,n)<<endl;
}
//system("pause");
return(0);
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNkZWZpbmUgZihpLG4pCWZvcihyZWdpc3RlciBsbGkgaT0wO2k8bjtpKyspCiNkZWZpbmUgTQkJMTAwMDAwMDAwNwp1c2luZyBuYW1lc3BhY2Ugc3RkOwp0eXBlZGVmIGxvbmcgbG9uZyBpbnQgbGxpOwpsbGkgZ2NkKGxsaSBhLCBsbGkgYikgCnsKCWxsaSB0OwogICAgd2hpbGUgKGIpIAogICAgewoJCXQgPSBhOwogICAgICAgIGEgPSBiOyAgICAKICAgICAgICBiID0gdCViOyAgIAoJfQoJcmV0dXJuIGE7Cn0KbGxpIG1vZF9vZl9sY20obGxpIGFbXSxsbGkgbikKewoJbGxpIGFucz0xOwoJZihpLG4pCiAJewogCQlpZihhW2ldIT0xKQogCQl7CiAJCQlmb3IobGxpIGo9aSsxO2o8bjtqKyspCiAJCQl7CiAJCQkJYVtqXS89Z2NkKGFbaV0sYVtqXSk7CgkJCQkvL3JlZHVjaW5nIGFsbCByZW1haW5pbmcgbnVtYmVycyBieSB0aGllciBnY2Qgd2l0aCBjdXJyZWJ0IG51bWJlcgoJCQl9CgkJCWFucz0oYW5zKmFbaV0pJU07Ly9tb2QKCQl9Cgl9CglyZXR1cm4gYW5zOwp9CmludCBtYWluKCkKewogCWludCB0PTE7CiAJbGxpIG47CiAJZihoLHQpCiAJewogCQljaW4+Pm47CiAJCWxsaSBhW25dOwogCQlmKGksbikKIAkJCWNpbj4+YVtpXTsKCQljb3V0PDxtb2Rfb2ZfbGNtKGEsbik8PGVuZGw7CiAJfQogCS8vc3lzdGVtKCJwYXVzZSIpOwogCXJldHVybigwKTsKfQo=