10025

#include <iostream>

using namespace std;

unsigned long long int T[60001];

int main()
{
int t,n,c=0;
int r,pos;
T[1]=1;
for(int i=2;i<60001;i++)
T[i]=T[i-1]+i;

//cout<<T[60000]<<"\n";
cin>>t;
c=t;
int k=0;
while(t--)
{
cin>>n;

if(k!=c &&k!=0)
cout<<"\n";
k++;
if(n==0)
{
cout<<3<<"\n";
continue;
}
if(n==1)
{
cout<<2<<"\n";
continue;
}
if(n<0)
n*=-1;
for(int i=1;i<60001;i++)
{
if(T[i]>=n)
{
r= T[i];
pos=i;
break;
}
}

int d=r-n;

if(d==0 || d%2==0)
{
cout<<pos<<"\n";
continue;
}
while((T[pos]-n)%2==1)
{
pos++;
}

cout<<pos<<"\n";

}

return 0;
}