#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& _p) {
  return os << "(" << _p.first << "," << _p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& _V) {
  bool f = true;
  os << "[";
  for (auto v : _V) {
    os << (f ? "" : ",") << v;
    f = false;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& _S) {
  bool f = true;
  os << "(";
  for (auto s : _S) {
    os << (f ? "" : ",") << s;
    f = false;
  }
  return os << ")";
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& _M) {
  return os << set<pair<T, U>>(_M.begin(), _M.end());
}
const signed long long INF = 1000000100;
const long double EPS = 1e-9;
int P[1000100];
void sito() {
  for (int(i) = (2); (i) <= (1000100); (i)++) {
    if (P[i] != 0) continue;
    P[i] = i;
    for (long long j = (long long)i * i; j < 1000100; j += i) {
      P[j] = i;
    }
  }
}
const int N = 1000010;
unsigned int ans[N][20];
const int mod = 1000000007;
const int odw2 = 500000004;
int main() {
  sito();
  for (int(i) = (0); (i) < (20); (i)++) ans[0][i] = 2;
  ans[0][0] = 1;
  for (int(i) = (1); (i) < (N); (i)++)
    for (int(j) = (0); (j) < (20); (j)++) {
      for (int(k) = (0); (k) <= (j / 2); (k)++) {
        ans[i][j] =
            (ans[i][j] + ((k != j - k) ? (ans[i - 1][j - k] + ans[i - 1][k])
                                       : ans[i - 1][k]));
        if (ans[i][j] > mod) ans[i][j] %= mod;
      }
    }
  int q;
  scanf("%d", &q);
  for (int(i) = (1); (i) <= (q); (i)++) {
    int a, b;
    scanf("%d%d", &a, &b);
    long long ans1 = 1;
    while (b != 1) {
      int p = P[b];
      int d = 0;
      while (b % p == 0) {
        b /= p;
        d++;
      }
      ans1 = (ans1 * ans[a][d]);
      if (ans1 > mod) ans1 %= mod;
    }
    printf("%lld\n", ans1);
  }
}
