#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="ciuperci";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
const int mod=666013;
void solve(ll n, int &x, int &y) {
    if (!n) {
        x=y=1;
        return;
    }
    if (n==1) {
        x=2,y=1;
        return;
    }
    if (n==2) {
        x=1,y=2;
        return;
    }

    int xx,yy;
    if (n%2==1) {
        solve(n/2,xx,yy);
        x=(2*xx)%mod*yy%mod;
        y=(yy*yy)%mod;
    }
    else {
        solve(n/2-1,xx,yy);
        x=(xx*xx)%mod;
        y=(2*xx)%mod*yy%mod;
    }
}
int main(){
    int q;
    f>>q;
    while (q--) {
        ll n;
        f>>n;
        int x,y;
        solve(n,x,y);
        g<<y<<nl;
    }
    system("pause");
    return 0;
}