Problem: Bash got tired on his journey to become the greatest Pokemon master. So he decides to take a break and play with functions.

Bash defines a function f0(n), which denotes the number of ways of factoring n into two factors p and q such that gcd(p, q) = 1. In other words, f0(n) is the number of ordered pairs of positive integers (p, q) such that p·q = n and gcd(p, q) = 1.

But Bash felt that it was too easy to calculate this function. So he defined a series of functions, where fr + 1 is defined as:

<image>

Where (u, v) is any ordered pair of positive integers, they need not to be co-prime.

Now Bash wants to know the value of fr(n) for different r and n. Since the value could be huge, he would like to know the value modulo 109 + 7. Help him!

Input

The first line contains an integer q (1 ≤ q ≤ 106) — the number of values Bash wants to know.

Each of the next q lines contain two integers r and n (0 ≤ r ≤ 106, 1 ≤ n ≤ 106), which denote Bash wants to know the value fr(n).

Output

Print q integers. For each pair of r and n given, print fr(n) modulo 109 + 7 on a separate line.

Example

Input

5
0 30
1 25
3 65
2 5
4 48


Output

8
5
25
4
630

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > primeDivisors(1000001);
int dp[20][1000001];
void PreProcessing() {
  for (int i = 2; i < 1000001; i++)
    if (primeDivisors[i].size() == 0) {
      for (int j = i; j < 1000001; j += i) primeDivisors[j].push_back(i);
    }
  for (int j = 0; j < 1000001; j++) dp[0][j] = 1;
  for (int i = 1; i < 20; i++) {
    dp[i][0] = 2;
    for (int j = 1; j < 1000001; j++)
      dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % 1000000007;
  }
}
int main() {
  int q, n, r, x;
  long long ans;
  PreProcessing();
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &r, &n);
    x = n;
    ans = 1;
    for (auto p : primeDivisors[x]) {
      int k = 0;
      while (n % p == 0) n /= p, k++;
      ans = (ans * dp[k][r]) % 1000000007;
    }
    printf("%lld\n", ans);
  }
  return 0;
}