CF 29.09 C

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}
bool sh = 1;
ll mod = 998244353;
vector <ll> F(33,1);
ll C(ll n, ll k) {
    return F[n] / F[k] / F[n - k];
}

int main() {
    /*ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);*/
    ll t = 1, n;
    if (!sh) cin >> t;

    for (int i = 2; i <= 32; ++ i) {
        F[i] = F[i - 1] * i ;
    }
    if (sh) {
        cout << "F\n";
        cvl(F);
    }
    vector <ll> dp(32);
    dp[0] = 1;
    dp[1] = 3;
    for (ll i = 2; i <= 31; ++i) {
        ll ad = C(2 * i + 1, i);
        if (sh) {
            cout << "i ad = " << i << ' ' << ad << "\n";
        }
        dp[i] = dp[i - 1] + ad;
        dp[i] %= mod;
    }
    if (sh) {
        cout << "dp\n";
        cvl(dp);
    }
    for (int go = 0; go < t; ++go) {
        cin >> n;
        ll A = dp[n / 2 - 1], B = 0;
        if (n > 2) B = dp[n / 2 - 2];
        cout << A << ' ' << B << ' ' << 1 << "\n";
    }
}