#include <bits/stdc++.h>
 
 #define dumb ios_base::sync_with_stdio(false);cin.tie(NULL);
    
 typedef  long long ll;

  using namespace std;

#define modulo 1000000007;

bool isprime(long long n)
{
    for(long long int i=2;i*i<=n;i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;
}
long long gcd(long long int a, long long int b)
{
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

// Function to return LCM of two numbers
long long lcm(int a, int b)
{
    return (a / gcd(a, b)) * b;
}


ll ncr(ll n,ll k)
{
    ll res = 1;
    if (k > n - k)
        k = n - k;
    for (ll i = 0; i < k; ++i) {
        res *= (n - i);
        res /= (i + 1);
    }
    return res;
}

map<int,int> m;

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

  auto it=m.lower_bound(n);
  if(it->first==n)
  {
    cout<<it->second<<endl;
    return;
  }
  else
  {
    int diff=it->first-n;
    if(diff==1)
      cout<<it->second+1<<endl;
    else
      cout<<it->second<<endl;
    
    return;
  }

return; 
}






int main()
{
  dumb;
    int t=1;
    cin>>t;
    int i=1;
    m[0]=0;
    int sum=0;
    while(1)
    {
      m[sum+i]=i;
      if(sum+i>1000000)
        break;
      sum+=i;
      i++;
    }
    while(t--)
    {
      //cout<<"in";
       solve(); 
    }

    return 0;
}