#include<bits/stdc++.h>
#define mx 1000001
using namespace std;
long long  mark[1000001];
void solve(){
    int sum=0;
    for(int i=0;i<mx;i++){
         sum+=i;
         mark[i]=sum;
    }
}
int main(){
    solve();
    int tc;
    long long n;
    scanf("%d",&tc);
    for(int i=1;i<=tc;i++){
        scanf("%lld",&n);
        long long ans=lower_bound(mark,mark+n+1,n)-mark;
        if(ans==0) printf("1\n");
        else if((ans*(ans+1))/2==n)
        cout<<ans<<endl;
        else cout<<ans-1<<endl;
    }
    return 0;
}