#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int N = 1000000;
int n, r, q;
int lp[N + 1];
int dp[21][N + 1];
int main() {
  for (int i = 2; i <= N; i += 2) lp[i] = 2;
  for (int i = 3; i <= 1000; i += 2)
    if (!lp[i]) {
      lp[i] = i;
      for (int j = i * i; j <= N; j += (i + i)) {
        lp[j] = i;
      }
    }
  for (int i = 2; i <= N; ++i) {
    if (!lp[i]) lp[i] = i;
  }
  for (int i = 1; i <= 20; ++i) dp[i][0] = 2;
  for (int j = 1; j <= N; ++j) {
    dp[0][j] = 1;
    for (int k = 1; k <= 20; ++k) {
      dp[k][j] = (dp[k - 1][j] + dp[k][j - 1]);
      if (dp[k][j] >= mod) dp[k][j] -= mod;
    }
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d", &r, &n);
    long long ans = 1;
    for (int i = lp[n]; n != 1; i = lp[n]) {
      int p = 0;
      while (n % i == 0) {
        p++;
        n /= i;
      }
      ans = (ans * dp[p][r]) % mod;
    }
    printf("%d\n", ans);
  }
}
