2769. Jumping Jack

2769. Jumping Jack

 

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump will be exactly one longer than the previous one. He can go either left or right with each jump. He wonders how many jumps he needs to reach x.

Input

The input data consists of only one integer x (-109≤x≤109).

Output

Output the minimal number of jumps that Jack requires to reach x.

Examples

Input

2

Output

3

Input

6

Output

3

Input

0

Output

0

 

#include
using namespace std;
int main()
{
    long long x;
    scanf("%lld",&x);
    if(x<0)x=-x;
    int res = 0;
    int tot = 0;
    while(tot

----------------------------------------------------------------

#include
#include
#include
#include
using namespace std;
 
int main(){
	
	long long a, b;
	
	scanf("%lld", &a);
	a = abs(a);
	b = (-1 + sqrt(1+8 * a)) / 2;	//第多少次跳跃 
	long long h = (1 + b) * b / 2;	// 求和 
	if(h == a){
		printf("%lld\n", b);
	}
	else{
		long long e = a - h;
		e = b + 1 - e;
		b++;
		if(e % 2 == 0){
			printf("%lld\n", b);
		}
		else if((e + b + 1) % 2 == 0){
			printf("%lld\n", b+1);
		}
		else{
			printf("%lld\n", b+2);
		}
	}
	return 0;
}