#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int M = 1e3 + 7;
const int MOD = 1e9 + 7;
int p[M], vis[M], len;
void prime() {
  for (int i = 2; i < M; ++i) {
    if (!vis[i]) {
      p[len++] = i;
    }
    for (int j = 0; j < len && i * p[j] < M; ++j) {
      vis[i * p[j]] = true;
      if (!(i % p[j])) break;
    }
  }
}
int val[N][20];
int main() {
  int q, r, n;
  prime();
  for (int i = 0; i < 20; ++i) {
    val[0][i] = i == 0 ? 1 : 2;
  }
  for (int i = 1; i < N; ++i) {
    for (int j = 0; j < 20; ++j) {
      val[i][j] = j == 0 ? 1 : val[i - 1][j] + val[i][j - 1];
      if (val[i][j] >= MOD) val[i][j] -= MOD;
    }
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &r, &n);
    long long ans = 1;
    for (int i = 0; i < len; ++i) {
      int num = 0;
      while (n % p[i] == 0) {
        n /= p[i];
        num++;
      }
      ans *= val[r][num];
      ans %= MOD;
      if (n == 1) break;
    }
    if (n > 1) {
      ans *= val[r][1];
      ans %= MOD;
    }
    printf("%lld\n", ans);
  }
  return 0;
}
