#include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 2, mxt = 20, mod = 1e9 + 7;
int n, ps[maxx][mxt];
bool ip[maxx];
vector<int> v[maxx];
void era() {
  for (int i = 2; i < maxx; i++) {
    if (!ip[i]) {
      v[i].push_back(i);
      for (int j = 2 * i; j < maxx; j += i) ip[j] = true, v[j].push_back(i);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  era();
  ps[0][0] = 1;
  for (int i = 1; i < mxt; i++) ps[0][i] = 2;
  for (int i = 1; i < maxx; i++) {
    ps[i][0] = 1;
    for (int j = 1; j < mxt; j++)
      ps[i][j] = (ps[i][j - 1] + ps[i - 1][j]) % mod;
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int nn, r, n, p = 0;
    long long ans = 1ll;
    cin >> r >> n;
    nn = n;
    while (n > 1) {
      int t = 0, x = v[nn][p];
      while (n > 1 && n % x == 0) n /= x, t++;
      ans = (ans * ps[r][t]) % mod;
      p++;
    }
    cout << ans << '\n';
  }
  return 0;
}
