#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int die = 0;
const double eps = 1e-9;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int q;
int r, n;
int f[N][20];
int sum[N][20];
int prime[N], tot = 0, vis[N];
void pre() {
  for (int i = (2); i <= (1e6); i++) {
    if (!vis[i]) prime[++tot] = i;
    for (int j = (1); j <= (tot); j++) {
      int x = prime[j] * i;
      if (x > 1e6) break;
      vis[x] = 1;
      if (i % prime[j] == 0) break;
    }
  }
}
void init() {
  sum[0][0] = f[0][0] = 1;
  for (int i = (1); i <= (20); i++)
    f[0][i] = 2, sum[0][i] = sum[0][i - 1] + f[0][i];
  for (int r = (1); r <= (1e6); r++) {
    sum[r][0] = f[r][0] = 1;
    for (int k = (1); k <= (20); k++) {
      f[r][k] = sum[r - 1][k];
      sum[r][k] = (sum[r][k - 1] + f[r][k]) % mod;
    }
  }
}
signed main() {
  init(), pre();
  q = read();
  while (q--) {
    r = read(), n = read();
    long long ans = 1;
    int m = sqrt(n + 0.5);
    for (int i = (1); i <= (tot); i++) {
      if (prime[i] > n || prime[i] > m) break;
      int cnt = 0;
      while (n % prime[i] == 0) cnt++, n /= prime[i];
      ans = (ans * f[r][cnt]) % mod;
    }
    if (n > 1) ans = (ans * f[r][1]) % mod;
    printf("%lld\n", ans);
  }
}
