50pts求调必关

#include<bits/stdc++.h>
#include<cstdio>
#define ll long long
using namespace std;
const int mod = 998244353;
const int N = 1000010;
int f[6721][6721],pos1[N],pos2[N],T,tot,pos;
ll x[N],n,sqrtn,tmp;
int read(){
	int sum = 0 , f = 1;
	char c = getchar();
	while(c < '0' or c > '9')
	{
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' and c <= '9')
	{
		sum = (sum << 1) + (sum << 3) + c - '0';
		c = getchar();
	}
	return sum * f;
}
void uppp(){
	while (T--){
		n=read();
		tot = 0,sqrtn = (ll) sqrt(n);
		for (ll i=1;i*i<=n;i++){
			if (n%i==0){
				x[++tot]=i;
				if (i*i!=n){
					x[++tot]= n/i;
				}
			}
		}
		sort(x+1,x+tot+1);
		for (int i=1;2*i<=tot+1;i++){
			pos1[x[i]]=i;
			pos2[x[i]]=tot-i+1;
		}
		for (int i=1;i<=tot;i++){
			f[i][1]=i==1?1:0;
			for (int j=2;j<=tot;j++){
				f[i][j]=f[i][j-1];
				if (j>i){
					continue;
				}
				if (x[i]%x[j]==0){
					tmp=x[i]/x[j];
					pos=tmp<=sqrtn?pos1[tmp]:pos2[n/tmp];
					f[i][j]=(f[i][j]+f[pos][j-1])%mod;
				}
			}
		}
		printf("%d\n",f[tot][tot]-1);
	}
}
int main(){
	T=read();
	uppp();
	return 0;
}