坑点:此题需用map!
#include <bits/stdc++.h>
using namespace std;
long long ans = 1,n,x,mod = 1000000007;
unordered_map<long long,long long> mp;
int main()
{
cin>>n;
while(n--)
{
cin>>x;
for(long long i = 2;i <= x / i; i++)
{
while(x % i == 0)
{
x /= i;
mp[i]++;
}
}
if(x > 1) mp[x]++;
}
for(auto i : mp) ans *= (i.second + 1),ans %= mod;
cout<<ans;
return 0;
}