## Algorithm

B. 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
Copy
2
output
Copy
3
input
Copy
6
output
Copy
3
input
Copy
0
output
Copy
0

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>

int main(){

long n; scanf("%ld\n", &n);
if(n < 0){n = -n;}
long sum(0), ans(0), p(1);
for(p = 1; sum < n; sum += p, p++, ans++);
long diff = sum - n;
if(n == 0){puts("0");}
else if(diff % 2 == 0){printf("%ld\n", ans);}
else if((diff + p) % 2 == 0){printf("%ld\n", ans + 1);}
else{printf("%ld\n", ans + 2);}

return 0;
}
Copy The Code &

Input

cmd
2

Output

cmd
3