#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int dp[23][1000001];
int pref[23][1000001];
int sieve[1001000];
int main(void) {
  for (int i = 1; i <= 20; i++) {
    dp[i][0] = 2;
    pref[i][0] = (dp[i][0] + pref[i - 1][0]) % mod;
  }
  for (int r = 1; r <= 1e6; r++) {
    for (int i = 1; i <= 20; i++) {
      dp[i][r] = (pref[i][r - 1] + 1) % mod;
      pref[i][r] = (dp[i][r] + pref[i - 1][r]) % mod;
    }
  }
  sieve[1] = 1;
  for (int i = 2; i <= 1e6; i++) {
    if (sieve[i] == 0) {
      for (int j = i; j <= 1e6; j += i) sieve[j] = sieve[j] == 0 ? i : sieve[j];
    }
  }
  int t;
  scanf("%d", &t);
  while (t--) {
    int r, n;
    scanf("%d %d", &r, &n);
    if (n == 1) {
      printf("1\n");
      continue;
    }
    vector<int> p, mul;
    int x = n;
    while (x != 1) {
      if (p.empty() || p.back() != sieve[x]) {
        p.push_back(sieve[x]);
        mul.push_back(1);
      } else {
        mul[mul.size() - 1]++;
      }
      x /= sieve[x];
    }
    int ans = 1;
    for (int i = 0; i < p.size(); i++)
      ans = (ans * (long long)dp[mul[i]][r]) % mod;
    printf("%d\n", ans);
  }
}
