#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
const int mxN = 1e6 + 10;
const int C = 20;
int g[mxN][C];
int pref[mxN][C];
int minDiv[mxN];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  for (int i = 0; i < C; i++) {
    g[0][i] = (i > 0) + 1;
    pref[0][i] = pref[0][max(0, i - 1)] + g[0][i];
  }
  for (int i = 1; i < mxN; i++) {
    minDiv[i] = i;
    for (int j = 0; j < C; j++) {
      g[i][j] = pref[i - 1][j];
      pref[i][j] = (pref[i][max(0, j - 1)] + g[i][j]) % mod;
    }
  }
  for (int i = 2; i < mxN; i++) {
    if (minDiv[i] != i) continue;
    for (int j = i * 2; j < mxN; j += i) minDiv[j] = min(minDiv[j], i);
  }
  int q;
  cin >> q;
  while (q--) {
    int r, n;
    cin >> r >> n;
    int ans = 1;
    while (n > 1) {
      int d = minDiv[n];
      int cnt = 0;
      while (n % d == 0) {
        n /= d;
        cnt++;
      }
      ans = 1ll * ans * g[r][cnt] % mod;
    }
    cout << ans << '\n';
  }
  return 0;
}
