#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 10, base = 1e9 + 7;
int test, n, r, sieve[maxN];
long long val[21][maxN];
pair<int, int> f[maxN];
vector<int> prime;
void eratos() {
  for (int i = 2; i * i < maxN; i++)
    if (sieve[i] == 0)
      for (int j = i * i; j < maxN; j += i) sieve[j] = i;
  for (int i = 2; i < maxN; i++)
    if (sieve[i] == 0) prime.push_back(i);
}
void init() {
  eratos();
  for (int i = 2; i < maxN; i++)
    if (sieve[i] == 0)
      f[i] = pair<int, int>(i, 1);
    else {
      int p = sieve[i];
      if (f[i / p].first == p)
        f[i] = pair<int, int>(p, f[i / p].second + 1);
      else
        f[i] = pair<int, int>(-1, 0);
    }
  for (int i = 1; i <= 20; i++) val[i][0] = 2;
  for (int i = 1; i <= 20; i++)
    for (int j = 1; j < maxN; j++) {
      if (i == 1)
        val[i][j] = val[i][j - 1] + 1;
      else
        val[i][j] = (val[i - 1][j] + val[i][j - 1]) % base;
    }
}
int main() {
  init();
  scanf("%d", &test);
  while (test--) {
    scanf("%d%d", &r, &n);
    long long res = 1;
    for (int i = 0; i < prime.size() && n > 1; i++) {
      if (n % prime[i] == 0) {
        int v = 1;
        while (n % prime[i] == 0) n /= prime[i], v *= prime[i];
        res = (res * val[f[v].second][r]) % base;
      }
      if (f[n].second) {
        res = (res * val[f[n].second][r]) % base;
        break;
      }
    }
    cout << res << "\n";
  }
}
