90分求条

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn(1e5+10);
ll q,n;
int main(){
	cin>>q;
	while(q--){
		cin>>n;
		ll now(sqrt(n));
		ll ans(3*(now-1));
		ll z(n-(now*now)+1);
		if(now*now==n){
			cout<<ans+1<<'\n';
		}else if(z==(2*now+1)){
			cout<<ans+3<<'\n';
		}else if(z>=(2*now+2)/2){
			cout<<ans+2<<'\n';
		}else{
			cout<<ans+1<<'\n';
		}
	}
	return 0;
}