#include<iostream>
#include<algorithm>
#include<cstring>
#include<unordered_map>
using namespace std;
const int MOD=1e9+7;
typedef long long LL;


int main()
{
    int n;
    cin>>n;
    unordered_map<int,int>prime;
    while(n--)
    {
      int a;    
      scanf("%d",&a);    
      for(int i=2;i<=a/i;i++)            
      {
          while(a%i==0)
          {
              a/=i;
              prime[i]++;
          }
      }
      if(a>1)prime[a]++;
    }
    LL res=1;
    for(auto pr:prime)
    {
        int x=pr.first,b=pr.second;
        LL t=1;
        while(b--)
        {
            t=(x*t+1)%MOD;
        }
        res=(res*t)%MOD;
    }
    cout<<res<<endl;
    return 0;
}