#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;

long long modpow(long long a, long long n,ll mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}


int main(){
    ll n;
    cin >> n;
    vector<ll>p(n);
    rep(i,n)cin>>p[i];
    rep(i,n){
        if(p[i]==2){
            cout << 2 << endl;
        }
        else cout << (p[i]-1)*(p[i]-1) << endl;
    }

    return 0;
}