void work(int n)
{
    for(int i = 2; i <= sqrt(n); i ++ )
        while(n % i == 0) n/=i,prime[++t]++;
       if(n>1) prime[++t] = 1;
}

void print()
{
    LL ans = 1;
    for(int i = 1; i <= t; i ++ )
       ans = ans*(prime[i] + 1)%mod;
    cout<<ans<<endl;
}