#include <bits/stdc++.h>
using namespace std;
static long long f[1000000 + 10][20 + 1];
static bool mark[1000000 + 10];
static vector<int> pw[1000000 + 10];
int main() {
  f[0][0] = 1;
  for (int i = 1; i <= 20; i++) f[0][i] = 2;
  for (int i = 1; i <= 1000000; i++) {
    f[i][0] = 1;
    for (int j = 1; j <= 20; j++)
      f[i][j] = (f[i][j - 1] + f[i - 1][j]) % 1000000007;
  }
  for (int i = 2; i <= 1000000; i++)
    if (!mark[i]) {
      pw[i].push_back(1);
      for (int j = i + i; j <= 1000000; j += i) {
        mark[j] = true;
        int t = 0, x = j;
        while (x % i == 0) {
          x /= i;
          t++;
        }
        pw[j].push_back(t);
      }
    }
  int q;
  scanf("%d", &q);
  while (q--) {
    int r, n;
    scanf("%d%d", &r, &n);
    long long ans = 1;
    for (auto p : pw[n]) ans = ans * f[r][p] % 1000000007;
    printf("%lld\n", ans);
  }
  return 0;
}
