/** * author: nok0 * created: 2020.09.18 22:54:24 **/ #ifdef LOCAL #define _GLIBCXX_DEBUG #endif #include using namespace std; #pragma region Macros #define ll long long #define ld long double #define FOR(i,l,r) for(int i=(l);i<(r);++i) #define REP(i,n) FOR(i,0,n) #define REPS(i,n) FOR(i,1,n+1) #define RFOR(i,l,r) for(int i=(l);i>=(r);--i) #define RREP(i,n) RFOR(i,n-1,0) #define RREPS(i,n) RFOR(i,n,1) #define pb push_back #define eb emplace_back #define SZ(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() template using V = vector; template using VV = V>; using pii = pair; using pll = pair; #define VEC(type, name, size)\ V name(size);\ IN(name) #define VVEC(type, name, h, w)\ VV name(h, V(w));\ IN(name) #define INT(...)\ int __VA_ARGS__;\ IN(__VA_ARGS__) #define LL(...)\ ll __VA_ARGS__;\ IN(__VA_ARGS__) #define STR(...)\ string __VA_ARGS__;\ IN(__VA_ARGS__) #define CHAR(...)\ char __VA_ARGS__;\ IN(__VA_ARGS__) #define DOUBLE(...)\ DOUBLE __VA_ARGS__;\ IN(__VA_ARGS__) #define LD(...)\ LD __VA_ARGS__;\ IN(__VA_ARGS__) void scan(int &a) { cin >> a; } void scan(long long &a) { cin >> a; } void scan(char &a) { cin >> a; } void scan(double &a) { cin >> a; } void scan(long double &a) { cin >> a; } void scan(char a[]) { scanf("%s", a); } void scan(string &a) { cin >> a; } template void scan(V &); template void scan(pair &); template void scan(V &a) { for(auto &i : a) scan(i); } template void scan(pair &p){ scan(p.first); scan(p.second); } template void scan(T &a) { cin >> a; } void IN() {} template void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); } template inline void print(T x){ cout << x << '\n';} template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p){ os << p.first << " " << p.second; return os; } template ostream &operator<<(ostream &os, const V &v){ REP(i, SZ(v)){ if(i) os << " "; os << v[i]; } return os; } //debug template void view(const V &v){ cerr << "{ "; for(const auto &e : v){ cerr << e << ", "; } cerr << "\b\b }"; } template void view(const VV &vv){ cerr << "{\n"; for(const auto &v : vv){ cerr << "\t"; view(v); cerr << "\n"; } cerr << "}"; } template void view(const V> &v){ cerr << "{\n"; for(const auto &c : v) cerr << "\t(" << c.first << ", " << c.second << ")\n"; cerr << "}"; } template void view(const map &m){ cerr << "{\n"; for(auto &t : m) cerr << "\t[" << t.first << "] : " << t.second << "\n"; cerr << "}"; } template void view(const pair &p){ cerr << "(" << p.first << ", " << p.second << ")";} template void view(const set &s) { cerr << "{ "; for(auto &t : s) { view(t); cerr << ", "; } cerr << "\b\b }"; } template void view(T e) { cerr << e;} #ifdef LOCAL void debug_out() {} template void debug_out(Head H, Tail... T) { view(H); cerr << ", "; debug_out(T...); } #define debug(...) \ do{ \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \ debug_out(__VA_ARGS__); \ cerr << "\b\b]\n"; \ } while(0) #else #define debug(...) (void(0)) #endif template V press(V &x){ V res = x; sort(all(res)); res.erase(unique(all(res)), res.end()); REP(i, SZ(x)){ x[i] = lower_bound(all(res), x[i]) - res.begin(); } return res; } template inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; } template inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; } inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';} inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';} inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}} template inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}} template T divup(T x, T y) {return (x+(y-1))/y;} template T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; } struct iofast{iofast(){ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15);}}iofast_; const int inf = 1e9; const ll INF = 1e18; #pragma endregion void solve(){ LL(p); if(p == 2) print(2); else print((p - 1) * (p - 1)); } int main(){ INT(t); while(t--) solve(); }