l={(n*(n+1))//2:n for n in range(1,1415)}
for _ in [0]*int(input()):
x=int(input())
for i in l:
if i>=x:
break
if x==i-1:
print(l[i]+1)
else:
print(l[i])#include<bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main(){
int t;
cin>>t;
while(t--)
{
int x;
cin>>x;
int count=0;
for(int i=0;i<x;i++)
{
if(count*(count+1)/2<x)
count++;
else
break;
}
if(count*(count+1)/2==x+1)
count++;
cout<<count<<endl;
}
}543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |