#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;

void solve (int p) {
  if (p == 2) cout << 2 << endl;
  else cout << (ll)(p - 1) * (p - 1) << endl;
}

int main() {
  int n;
  cin >> n;
  while (n--) {
    int p;
    cin >> p;
    solve(p);
  }
  return 0; 
}