void work(LL x)
{
    for(int i = 2; i <= sqrt(x); i ++ )
       while(x % i == 0)
       {
           d[++t] = i;
           prime[t]++;
           x/=i;
       }

    if(x > 1) prime[++t] = 1;
}

void print()
{
   LL res = 1;
   for(int i = 1; i <= n; i ++ )
      {
          int t = 1;
          while(prime[i] -- ) t = t * d[i] + 1;
          res = res * t;
      }
      cout<<res<<endl;
}