#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  int n;
  cin >> n;

  int res = -1;
  auto issq = [&](int x) -> bool {
    int sq = sqrt(x);
    return sq * sq == x;
  }; 

  for (int i = 1000; i >= 1; i--) {
    if (n > i) break;
    else {
      int x = (i * i) - (n * n);
      if (x > 0 && x < i * i && issq(x)) {
        int X = sqrt(x);
        res = max(res, i + n + X);
      }
    }
  }
  cout << res << "\n";
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}