#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 9;
ll f[N][21];
const int mod = 1e9 + 7;
int prime[N], cnt;
bool vis[N];
void init() {
  for (int i = 2; i < N; i++) {
    if (!vis[i]) prime[cnt++] = i;
    for (int j = 0; j < cnt; j++) {
      if (i * prime[j] >= N) break;
      vis[i * prime[j]] = 1;
      if (i % prime[j] == 0) break;
    }
  }
  f[0][0] = 1;
  for (int i = 1; i < 21; i++) f[0][i] = 2;
  for (int i = 1; i < N; i++) {
    f[i][0] = 1;
    for (int j = 1; j < 21; j++) f[i][j] = (f[i][j - 1] + f[i - 1][j]) % mod;
  }
}
int q, r, n;
ll d(int n) {
  ll ans = 1;
  for (int i = 0; i < cnt && prime[i] * prime[i] <= n; i++) {
    if (n % prime[i] == 0) {
      int t = 0;
      while (n % prime[i] == 0) n /= prime[i], t++;
      ans = (ans * f[r][t]) % mod;
    }
  }
  if (n > 1) ans = (ans * f[r][1]) % mod;
  return ans;
}
int main() {
  init();
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &r, &n);
    printf("%lld\n", d(n));
  }
  return 0;
}
