#include<iostream>
using namespace std;
typedef long long ll;
ll t,k;
const ll mod = 123456789;
struct Matrix {
static const int N = 6;
ll a[N][N];
Matrix(ll e = 0) {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
a[i][j] = e * (i == j);
}
}
}
Matrix mul(Matrix A, Matrix B) {
Matrix ans(0);
for(int i = 0; i < N; ++i)
for(int j = 0; j < N; ++j)
for (int k = 0; k < N; ++k) {
ans.a[i][j] = (ans.a[i][j] + A.a[i][k] * B.a[k][j]) % mod;
}
return ans;
}
Matrix ksm(Matrix A, int k) {
Matrix ans(1);
while (k) {
if (k & 1) ans = mul(ans, A);
A = mul(A, A);
k >>= 1;
}
return ans;
}
};
ll a[10];
int main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
a[1] = 2; a[2] = 1; a[3] = 8; a[4] = 4; a[5] = 2; a[6] = 1;
cin >> t;
while (t--) {
cin >> k;
k -= 2;
if (k < 1) {
cout << k + 2 << "\n";
continue;
}
Matrix tmp(0);
tmp.a[0][0] = 1, tmp.a[0][1] = 2, tmp.a[0][2] = 1, tmp.a[0][3] = 3, tmp.a[0][4] = 3, tmp.a[0][5] = 1;
tmp.a[1][0] = 1;
tmp.a[2][2] = 1, tmp.a[2][3] = 3, tmp.a[2][4] = 3, tmp.a[2][5] = 1;
tmp.a[3][3] = 1, tmp.a[3][4] = 2, tmp.a[3][5] = 1;
tmp.a[4][4] = 1, tmp.a[4][5] = 1;
tmp.a[5][5] = 1;
tmp = tmp.ksm(tmp, k);
ll res = 0;
for (int i = 0; i < 6; i++)
res = (res + tmp.a[0][i] * a[i]) % mod;
cout << res << "\n";
}
}