Codeforces Round894.D

#include <iostream>
#include <climits>
using namespace std;
#define ll long long

void solve(ll n)
{
	ll l = 1, r = INT_MAX,ans=0;// 2147483647
	while (l <= r)
	{
		ll mid = (l + r) >> 1;
		if ((mid * (mid - 1) / 2) > n) r = mid - 1;
		else
		{
			l = mid + 1;
			ans = mid;
		}
	}
	ll result = ans + n - (ans * (ans - 1) / 2);
	cout << result << endl;

}
int main()
{
	ios::sync_with_stdio(false); 
	cin.tie(nullptr);

	int t;
	ll n;
	cin >> t;
	while (t--)
	{
		cin >> n;
		solve(n);

	}

	return 0;
}