#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define sz(x) (int)(x).size()
#define li long long
#define ld long double
#define x first
#define y second
#define pt pair<int, int>
#define pll pair<ll, ll>
#define forn(i, t) for(int i = 0; i < (t); i++)
#define fore(i, f, t) for(int i = (f); i < (t); i++)
#define forr(i, f, t) for(int i = (f) - 1; i >= (t); i--)
#define all(x) (x).begin(), (x).end()
#define ins insert

using namespace std;


const li INF = 1e9;
const int MOD = 1e9 + 7;
const li INF64 = 1e18;
const ld EPS = 1e-5;

mt19937 myrand(time(NULL));

li n;


bool read(){
    if(scanf("%lld", &n) != 1)
        return 0;
    return 1;
}


const int N = 32000;


void solve(){
    ld x = n;
    x /= INF;

    forn(i, N){
        li t = (li)((x + i) * (x + i) + 0.5);
        ld p = sqrtl(t);

        if (t > 0 && int((p - (li)p) * INF) == n){
            printf("%lld\n", t);
            return;
        }
    }
}


int main(){
    #ifdef _DEBUG
        freopen("input.txt", "r", stdin);
    #endif

    int n;
    scanf("%d", &n);
    forn(i, n){
        read();
        solve();
    }
    return 0;
}