#include<bits/stdc++.h>
using namespace std;
#define  ll long long

ll f[1010];
const int qs=1e5+7;
const ll mod=1e9+7;

int t,n;

int main(){
	std::ios::sync_with_stdio(false);
	cin>>t;
	f[0]=0; int x=1;
	for(int i=1;i<=1003;++i){
		f[i]=x+f[i-1];
		x+=2;
	}
	while(t--){
		cin>>n;
		int ans=lower_bound(f+1,f+1+1003,n)-f;
		cout<<ans<<"\n";
	}
	
	
	
	
	return 0;
}

