10025 - The ? 1 ? 2 ? ... ? n = k problem

#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
    long long int n,i,count;
    cin>>n;
    while(n--)
    {
        cin>>count;
        if(count==0)cout<<"3"<<endl;
        else
        {
            i=0;
            while(1)
            {
                if(i%2==0)
                {
                    if(i/2*(1+i)>=abs(count))
                        if((i/2*(i+1)-abs(count))%2==0)
                        {
                            cout<<i<<endl;
                            break;
                        }
                }
                else
                {
                    if((i+1)/2*i>=abs(count))
                        if(((i+1)/2*i-abs(count))%2==0)
                        {
                            cout<<i<<endl;
                            break;
                        }
                }
                i++;
            }
        }
        if(n!=0)cout<<endl;
    }
    return 0;
}