题目:
题解:
代码:
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
unordered_map<int,int>m;
int n;
int main(){
scanf("%d",&n);
while(n--){
int x;
scanf("%d",&x);
for(int i=2;i<=x/i;i++){
while(x%i==0){
m[i]++;
x/=i;
}
}
if(x>1)m[x]++;
}
ll res=1;
for(auto t:m)res=res*(t.second+1)%mod;
printf("%lld\n",res);
return 0;
}