#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > primeDivisors(1000001);
int dp[20][1000001];
void PreProcessing() {
  for (int i = 2; i < 1000001; i++)
    if (primeDivisors[i].size() == 0) {
      for (int j = i; j < 1000001; j += i) primeDivisors[j].push_back(i);
    }
  for (int j = 0; j < 1000001; j++) dp[0][j] = 1;
  for (int i = 1; i < 20; i++) {
    dp[i][0] = 2;
    for (int j = 1; j < 1000001; j++)
      dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % 1000000007;
  }
}
int main() {
  int q, n, r, x;
  long long ans;
  PreProcessing();
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &r, &n);
    x = n;
    ans = 1;
    for (auto p : primeDivisors[x]) {
      int k = 0;
      while (n % p == 0) n /= p, k++;
      ans = (ans * dp[k][r]) % 1000000007;
    }
    printf("%lld\n", ans);
  }
  return 0;
}
