Codeforces Beta Round #11 B题

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

3

input

Copy

6

output

3

input

Copy

0

output

0

题意：比较有意思的思维题，刚开始没啥思路，想明白感觉挺简单，刚开始可以一个劲的向着目标跳，等到了跳过的时候，便可以将之前跳过的一步，两步，三步......折返，可以得到任意的偶数，所以如果你跳过目标的距离为偶数就可以折返回来。

#include<stdio.h>
#include <algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<algorithm>
#define ll long long
#define INF 0x3f3f3f3f
#define FAST_IO ios::sync_with_stdio(false)
using namespace std;

int main()
{
    ll sum=0,n,cot=0;
    cin>>n;
    n=abs(n);

    while(sum<n || (sum-n)%2)
    {
        cot++;
        sum+=cot;
    }

    cout<<cot<<endl;
    return 0;
}