#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int mod = 666013;

int t;
ll x;

vector<pair<ll, int>> H[mod];

void insert(ll x, int y)
{
    int r = x % mod;
    H[r].pb(mp(x, y));
}

int find(ll x)
{
    int r = x % mod;
    for(auto it : H[r])
        if(it.fi == x)
            return it.se;

    return 0;
}

int solve(ll x)
{
    int ans = find(x);
    if(ans) return ans;

    if(x & 1) ans = (1LL * solve((x - 1) / 2) * solve((x - 1) / 2)) % mod;
    else ans = (2LL * solve(x / 2) * solve((x - 1) / 2)) % mod;

    insert(x, ans);

    return ans;
}

int main()
{
    freopen("ciuperci.in", "r", stdin);
    freopen("ciuperci.out", "w", stdout);

    scanf("%d", &t);

    H[1].pb(mp(1, 1));
    H[2].pb(mp(2, 2));

    for(; t; t--)
    {
        scanf("%lld", &x);
        printf("%d\n", solve(x));
    }

    return 0;
}