#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N;
    cin >> N;
    const int D = 1000;
    vector<int> p(D);
    rep(i, 0, 10) rep(j, 0, 10) rep(k, 0, 10) {
        if (i > j + k) p[i * 100 + j * 10 + k] = 1;
    }
    mint ans = 0;
    N++;
    map<ll, vector<vector<mint>>> m;
    auto f = [&](ll c) -> vector<vector<mint>> {
        if (m.count(c)) return m[c];
        vector dp(10, vector<mint>(10));
        vector<int> q;
        ll C = c;
        while (c) {
            q.push_back(c % 10);
            c /= 10;
        }
        reverse(all(q));
        int x = 0, y = 0;
        rep(i, 0, q.size()) {
            vector n_dp(10, vector<mint>(10));
            rep(a, 0, 10) rep(b, 0, 10) rep(c, 0, 10) {
                if (a > b + c) continue;
                n_dp[b][c] += dp[a][b];
            }
            if (x != INF) rep(k, 0, q[i]) {
                if (x <= y + k) {
                    n_dp[y][k] += 1;
                }
            }
            if (x > y + q[i]) x = INF;
            else x = y, y = q[i];
            swap(n_dp, dp);
        }
        m[C] = dp;
        return m[C];
    };
    p[0] = 1;
    ll sum = 1 + (N - 1) / D;
    rep(i, 1, D) {
        ll C = (N - i + D - 1) / D;
        if (C <= 0) continue;
        sum += C;
        if (p[i]) continue;
        mint val = 0;
        auto dp = f(C);
        int c = i / 100;
        int d = (i % 100) / 10;
        rep(a, 0, 10) rep(b, 0, 10) {
            if (a > b + c) continue;
            if (b > c + d) continue;
            val += dp[a][b];
        }
        int j = i;
        while (p[j] == 0) {
            j++;
            ans += val;
            if (j == D) j = 0;
        }
    }
    // cout << sum << "\n";
    ans += (mint)(N) * (mint)(N - 1) / 2;
    cout << ans.val() << "\n";
}

/*
 * f(N) を考える
 * まず、mod 1000 で考えると、答えはまあまあ近くにあることがわかる
 * 元々いい数なのは除外する
 * そうでないとき、繰り上がることでいい数になるのか？
 * いやないか
 * いい数になるとしても、　mod 1000 の世界
 * 下 3 桁ごとに場合分け
 *
 *
 */