#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
ll n;
string aespa="TTPC";
string s[4];
ll m[4];
const int N=1e6+5;
ll f1[N],f2[N];
ll tot[N],acc[N];
ll ord[N];
ll g1,g2,gg;
ll gcd(ll x,ll y){
	if(y==0) return x;
	return gcd(y,x%y);
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	int t;cin >> t;
	while(t--){
		ll n;cin >> n;
		ll l=0,r=1e9;
		while(l!=r){
			ll mid=(l+r+1)/2;
			if(mid*mid<=n) l=mid;
			else r=mid-1;
		}
		ll ans=(l-1)*(l-1);
		ll frog=n-l*l;
		if(frog>=l) ans+=2*l+1;
		else ans+=2*frog;
		cout << ans << '\n';
	}
}