#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }

void solve() {
    ll n;
    scanf("%lld", &n);
    ll inv2 = qmi(2, MOD - 2, MOD);
    ll res = 0;
    for (ll i = 1, p = 1; i < 42; i++, p = p * i / __gcd(p, i)) {
        if (p > n) break;
        ll t = (n / p - 1 + MOD) % MOD, g = p % MOD, iv = p / i % MOD;
        if (n / p - 1) res = (res + g * ((p / i * (1 + t) % MOD) * t % MOD * inv2 % MOD) % MOD) % MOD;
        res = (res + (n / p * p / i) % MOD * ((n - n / p * p + 1) % MOD)) % MOD;
    }
    printf("%lld\n", res);
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) solve();
    return 0;
}