import sys
input = sys.stdin.readline

# エラトステネスの篩を用いた素因数分解・約数列挙
MAX=5*10**5+10 # 使いたい最大値を指定

# Sieve[i]で、iの最も小さい約数を返す。
Sieve=[i for i in range(MAX)]

for i in range(2,MAX):
    if Sieve[i]!=i:
        continue
    
    for j in range(i,MAX,i):
        if Sieve[j]==j:
            Sieve[j]=i


# 素因数分解
def fact(x):
    D=dict()
    while x!=1:
        k=Sieve[x]
        if k in D:
            D[k]+=1
        else:
            D[k]=1
        x//=k
    return D

# 約数列挙
def faclist(x):
    LIST=[1]
    while x!=1:
        k=Sieve[x]
        count=0
        while x%k==0:
            count+=1
            x//=k

        LIST2=[]
        for l in LIST:
            for i in range(1,count+1):
                LIST2.append(l*k**i)
        LIST+=LIST2

    return LIST

mod=998244353

DP=[1]
X=[DP]
for i in range(2030):
    NDP=[0]*(len(DP)+1)

    for i in range(len(DP)):
        x=DP[i]
        NDP[i+1]+=x
        NDP[i+1]%=mod
        if i-1>=0:
            NDP[i-1]+=x
            NDP[i-1]%=mod
    DP=NDP
    X.append(DP)
    

T=int(input())

for tests in range(T):
    N,A=map(int,input().split())

    ANS=0

    for l in faclist(A):
        if l>=N:
            continue
        ANS+=X[N-1][l]
        ANS%=mod

    print(ANS)