#include <bits/stdc++.h>
using namespace std;
const int stdmod = 1000000007;
int spfact[1001000];
void seive(int n) {
  spfact[0] = spfact[1] = 0;
  for (int i = 0; i <= n; ++i) {
    spfact[i] = i;
  }
  for (int i = 2; i * i <= n; ++i)
    if (spfact[i] == i) {
      for (int j = i + i; j <= n; j += i) {
        if (spfact[j] == j) spfact[j] = i;
      }
    }
}
void pfact(int n, vector<int>& res) {
  res.clear();
  while (n > 1) {
    int p = spfact[n];
    int pwr = 0;
    while (n % p == 0) {
      n /= p;
      pwr++;
    }
    res.push_back(pwr);
  }
}
int dp[1000001][21];
int mul(int a, int b) {
  long long res = (long long)a * b;
  return (res >= stdmod ? res % stdmod : res);
}
int main() {
  ios::sync_with_stdio(false);
  seive(1000200);
  dp[0][0] = 1;
  for (int e = 1; e <= 20; ++e) dp[0][e] = 2;
  for (int r = 1; r <= 1000000; ++r) {
    dp[r][0] = 1;
    for (int e = 1; e <= 20; ++e)
      dp[r][e] = (dp[r - 1][e] + dp[r][e - 1]) % stdmod;
  }
  int q;
  scanf("%d", &q);
  vector<int> exps;
  while (q-- > 0) {
    int n, r;
    scanf("%d%d", &r, &n);
    pfact(n, exps);
    long long res = 1;
    for (auto e : exps) res = (res * dp[r][e]) % stdmod;
    printf("%lld\n", res);
  }
  return 0;
}
