/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
using ll=long long;

bool notprime[1000006];
vector<ll>lowestprime(1000006);
void seivelp()
{
    lowestprime[1]=1;
    for(int i=2;i<=1000000;i++)
    {
        if(notprime[i]) continue;
        lowestprime[i]=i;
        for(int j=i+i;j<=1000000;j+=i)
        {
            if(lowestprime[j]==0) lowestprime[j]=i;
            notprime[j]=true;
        }
    }
}

void primefactor(ll num,map<ll,ll>&m)
{
    while(lowestprime[num]!=1)
    {
        m[lowestprime[num]]++;
        num /= lowestprime[num];
    }
}

void solve()
{
    ll n,a; cin>>n;
    map<ll,ll>m;
    for(int i=0;i<n;i++)
    {
        cin>>a;
        primefactor(a,m);
    }
    ll ans=1,mod=1e9+7;
    for(auto e:m)
    {
        ans *= (e.second+1);
        ans %=mod;
    }
    cout<<ans<<endl;
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    seivelp();
    solve();
}