#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 29
#define mod 998244353
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int MD(int x)
{
    return (x>=mod)?x-mod:x;
}
int MD2(int x)
{
    return (x<0)?x+mod:x;
}
int fast_pow(int a,int b)
{
    int res=1,mul=a;
    while (b)
    {
	if (b&1) res=1ll*res*mul%mod;
	mul=1ll*mul*mul%mod,b>>=1;
    }
    return res;
}
int T,n,cnt,inv2,F[N+1],ans;
bool used[N+1];
long long delta[N+1];
bool cmp(long long x,long long y)
{
    return x>y;
}
void dfs(int x,bool op,long long res)
{
    int dst=0;
    long long rst=0;
    for (int i=0;i<=x;++i) rst+=delta[i];
    if (res+rst<=0) return;
    if (res-rst>0&&(x==-1||op))
    {
	for (int i=x+1;i<=cnt;++i)
	{
	    if (!used[i]) Adder(dst,delta[i]%mod);
	    else Adder2(dst,-delta[i]%mod);
	}
	for (int i=0;i<=x;++i) dst=2ll*dst%mod;
	Adder(ans,dst);
	return;
    }
    used[x]=0,dfs(x-1,op|(((n-1)>>x)&1),res+delta[x]);
    if (op||(((n-1)>>x)&1)) used[x]=1,dfs(x-1,op,res-delta[x]);
    return;
}
int main()
{
    T=read(),inv2=(mod+1)>>1;
    while (T--)
    {
	n=read(),cnt=ans=0;
	while ((1<<cnt)<n) cnt++;
	for (int i=0;i<=cnt;++i) F[i]=n/(1<<(i+1))*(1<<i)+max(n%(1<<(i+1))-(1<<i),0),delta[i]=1ll*F[i]*(1<<i);
	dfs(cnt,0,0),ans=1ll*ans*fast_pow(n,mod-2)%mod,Adder(ans,1ll*n*(n-1)%mod*inv2%mod),printf("%lld\n",1ll*ans*fast_pow(n,mod-2)%mod);
    }
    return 0;
}