func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = (int)1e9 + 7;   const int MOD2 = 1007681537;   const int INF = (int)1e9;   const long long LINF = (long long)1e18;   const long double PI = acos((long double)-1);   const long double EPS = 1e-9;   inline long long gcd(long long a, long long b) {     long long r;     while (b) {       r = a % b;       a = b;       b = r;     }     return a;   }   inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }   inline long long fpow(long long n, long long k, int p = MOD) {     long long r = 1;     for (; k; k >>= 1) {       if (k & 1) r = r * n % p;       n = n * n % p;     }     return r;   }   template <class T>   inline int chkmin(T& a, const T& val) {     return val < a ? a = val, 1 : 0;   }   template <class T>   inline int chkmax(T& a, const T& val) {     return a < val ? a = val, 1 : 0;   }   inline long long isqrt(long long k) {     long long r = sqrt(k) + 1;     while (r * r > k) r--;     return r;   }   inline long long icbrt(long long k) {     long long r = cbrt(k) + 1;     while (r * r * r > k) r--;     return r;   }   inline void addmod(int& a, int val, int p = MOD) {     if ((a = (a + val)) >= p) a -= p;   }   inline void submod(int& a, int val, int p = MOD) {     if ((a = (a - val)) < 0) a += p;   }   inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }   inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }   inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }   inline int sign(long double x, long double y) { return sign(x - y); }   long long ff(long long n, long long k) {     return min(k + k, k + (n - k) * (n - k - 1) / 2);   }   void solve() {     int test;     cin >> test;     while (test--) {       long long n;       cin >> n;       if (n <= 4) {         cout << n - 1 <<   n ;         continue;       }       long long lo = 1, hi = n - 3;       while (lo < hi) {         long long mi = lo + hi >> 1;         if (ff(n, mi) > ff(n, mi + 1)) {           hi = mi;         } else {           lo = mi + 1;         }       }       cout << max(n - 1, ff(n, lo + hi >> 1)) <<   n ;     }   }   int main() {     int JUDGE_ONLINE = 1;     if (fopen( in.txt ,  r )) {       JUDGE_ONLINE = 0;       assert(freopen( in.txt ,  r , stdin));     } else {       ios_base::sync_with_stdio(0), cin.tie(0);     }     solve();     if (!JUDGE_ONLINE) {     }     return 0;   }   