//Believe in yourself ,( try and try and then try ), You can do it
//You don't have to be great to start but you have to start to be great
#include <iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include <utility>
#include <stack>
#include <set>
#include <map>
#include<queue>
#include<set>
// 2D vector vector<vector<int>>v(n,vector<int>(m));
// sort and reverse in vector sort(v.begin(), v.end(), greater<int>());
// str.erase(pos,len); erase in string
// a = s.substr(0, i)<<before i, b = s.substr(i)<<from i to end;
// cout << (v[0] == 1 ? "YES" : "NO") << endl;
// unsigned long long int
// priority_queue<ll, vector<ll>, greater<ll>> p;
using namespace std;
#define ll long long
#define all(c) c.begin(),c.end()
ll gcd(ll a, ll b)
{
while (b != 0)
{
ll a2 = a;
a = b; b = a2 % b;
}
return a;
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
void soso()
{
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
ll sum(ll mid)
{
return (mid * (mid + 1)) / 2;
}
int main()
{
soso();
int t; cin >> t;
while (t--)
{
ll x; cin >> x;
ll l = 1, r = 1e19, ans = 0;
while (l <= r)
{
ll mid = (l + r) / 2;
if (x > sum(mid))l = mid + 1;
else
{
ll l22 = sum(mid - 1)+1, r22 = sum(mid);
while (l22 <= r22)
{
ll mid22 = (l22 + r22) / 2;
if (mid22 == x) { ans = mid; break; }
if (mid22 < x)l = mid22 + 1;
if (mid22 > x)r = mid22 - 1;
}
if (ans == 0)r = mid - 1;
else break;
}
}
cout << ans << "\n";
}
}
Ly9CZWxpZXZlIGluIHlvdXJzZWxmICwoIHRyeSBhbmQgdHJ5IGFuZCB0aGVuIHRyeSApLCBZb3UgY2FuIGRvIGl0IAovL1lvdSBkb24ndCBoYXZlIHRvIGJlIGdyZWF0IHRvIHN0YXJ0IGJ1dCB5b3UgaGF2ZSB0byBzdGFydCB0byBiZSBncmVhdCAKI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxhbGdvcml0aG0+CiNpbmNsdWRlPGNtYXRoPgojaW5jbHVkZTxzdHJpbmc+CiNpbmNsdWRlPHZlY3Rvcj4KI2luY2x1ZGUgPHV0aWxpdHk+CiNpbmNsdWRlIDxzdGFjaz4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGU8cXVldWU+CiNpbmNsdWRlPHNldD4KLy8gMkQgdmVjdG9yIHZlY3Rvcjx2ZWN0b3I8aW50Pj52KG4sdmVjdG9yPGludD4obSkpOwovLyBzb3J0IGFuZCByZXZlcnNlIGluIHZlY3RvciBzb3J0KHYuYmVnaW4oKSwgdi5lbmQoKSwgZ3JlYXRlcjxpbnQ+KCkpOwovLyBzdHIuZXJhc2UocG9zLGxlbik7IGVyYXNlIGluIHN0cmluZwovLyBhID0gcy5zdWJzdHIoMCwgaSk8PGJlZm9yZSBpLCBiID0gcy5zdWJzdHIoaSk8PGZyb20gaSB0byBlbmQ7Ci8vIGNvdXQgPDwgKHZbMF0gPT0gMSA/ICJZRVMiIDogIk5PIikgPDwgZW5kbDsKLy8gdW5zaWduZWQgbG9uZyBsb25nIGludAovLyBwcmlvcml0eV9xdWV1ZTxsbCwgdmVjdG9yPGxsPiwgZ3JlYXRlcjxsbD4+IHA7CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgYWxsKGMpICBjLmJlZ2luKCksYy5lbmQoKQoKCmxsIGdjZChsbCBhLCBsbCBiKQp7CiAgICB3aGlsZSAoYiAhPSAwKQogICAgewogICAgICAgIGxsIGEyID0gYTsKICAgICAgICBhID0gYjsgICAgICAgIGIgPSBhMiAlIGI7CiAgICB9CiAgICByZXR1cm4gIGE7Cn0KCmxsIGxjbShsbCBhLCBsbCBiKQp7CiAgICByZXR1cm4gYSAvIGdjZChhLCBiKSAqIGI7Cn0KCnZvaWQgc29zbygpCnsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKDApOwogICAgY2luLnRpZShOVUxMKTsKICAgIGNvdXQudGllKE5VTEwpOwp9CgpsbCBzdW0obGwgbWlkKQp7CiAgICByZXR1cm4gKG1pZCAqIChtaWQgKyAxKSkgLyAyOwp9CmludCBtYWluKCkKewogICAgc29zbygpOwogICAgaW50IHQ7IGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkKICAgIHsKICAgICAgICBsbCB4OyBjaW4gPj4geDsKICAgICAgICBsbCBsID0gMSwgciA9IDFlMTksIGFucyA9IDA7CiAgICAgICAgd2hpbGUgKGwgPD0gcikKICAgICAgICB7CiAgICAgICAgICAgIGxsIG1pZCA9IChsICsgcikgLyAyOwogICAgICAgICAgICBpZiAoeCA+IHN1bShtaWQpKWwgPSBtaWQgKyAxOwogICAgICAgICAgICBlbHNlCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGxsIGwyMiA9IHN1bShtaWQgLSAxKSsxLCByMjIgPSBzdW0obWlkKTsKICAgICAgICAgICAgICAgIHdoaWxlIChsMjIgPD0gcjIyKQogICAgICAgICAgICAgICAgewogICAgICAgICAgICAgICAgICAgIGxsIG1pZDIyID0gKGwyMiArIHIyMikgLyAyOwogICAgICAgICAgICAgICAgICAgIGlmIChtaWQyMiA9PSB4KSB7IGFucyA9IG1pZDsgYnJlYWs7IH0KICAgICAgICAgICAgICAgICAgICBpZiAobWlkMjIgPCB4KWwgPSBtaWQyMiArIDE7CiAgICAgICAgICAgICAgICAgICAgaWYgKG1pZDIyID4geClyID0gbWlkMjIgLSAxOwogICAgICAgICAgICAgICAgfQogICAgICAgICAgICAgICAgaWYgKGFucyA9PSAwKXIgPSBtaWQgLSAxOwogICAgICAgICAgICAgICAgZWxzZSBicmVhazsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICBjb3V0IDw8IGFucyA8PCAiXG4iOwogICAgfQoKfQ==