#include <bits/stdc++.h>
using namespace std;
long long fact[2000001];
long long inv[2000001];
vector<int> pr = {2};
long long nCr(int n, int r) {
  long long val = fact[n];
  val = val * inv[r] % 1000000007;
  val = val * inv[n - r] % 1000000007;
  return val;
}
int main() {
  fact[0] = 1;
  inv[0] = 1;
  for (int i = 1; i <= 2000000; i++) {
    fact[i] = fact[i - 1] * i % 1000000007;
  }
  inv[1] = 1;
  for (int i = 2; i <= 2000000; i++) {
    int left = 1000000007 - 2;
    long long res = 1;
    long long gop = i;
    while (left) {
      if (left & 1) {
        res *= gop;
        res %= 1000000007;
      }
      gop *= gop;
      gop %= 1000000007;
      left >>= 1;
    }
    inv[i] = res * inv[i - 1] % 1000000007;
  }
  for (int i = 3; i <= 2000; i += 2) {
    bool prime = true;
    for (int j = 0; pr[j] * pr[j] <= i; j++) {
      if (i % pr[j] == 0) {
        prime = false;
        break;
      }
    }
    if (prime) pr.push_back(i);
  }
  int t, n, r;
  scanf("%d", &t);
  while (t--) {
    scanf("%d %d", &r, &n);
    long long ans = 1;
    for (int j = 0; pr[j] * pr[j] <= n; j++) {
      int i = pr[j];
      int cnt = 0;
      while (n % i == 0) {
        cnt++;
        n /= i;
      }
      if (cnt) {
        if (r == 0)
          ans *= 2;
        else {
          long long cal =
              (2LL * nCr(r + cnt - 1, cnt - 1) + nCr(r + cnt - 1, cnt)) %
              1000000007;
          ans = ans * cal % 1000000007;
        }
      }
    }
    if (n > 1) {
      ans = ans * (r + 2) % 1000000007;
    }
    printf("%lld\n", ans);
  }
}
