codeforces 11B Jumping Jack

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 ( - 10⁹ ≤ x ≤ 10⁹).

Output

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

Example

Input

2

Output

3

Input

6

Output

3

Input

0

Output

0

这题想的很僵硬，想了一个小时才想出来。
题意：步数从1开始递增，只能选择向左走和向右走。问到达x最少要走几次。
解题思路：可以很轻易的（我推了半小时才反应过来）的想出 x=1±2±3±...n;
对吧，因为不是向左走就是向右走嘛，所以不是加就是减。
这样我们可以推出x肯定在1到1+2+3+...n之间(包括n。
所以我们找第一个大于等于x的 1~n和，如果刚好等于就直接输出步数。
如果大于x，就找第一个大于x且与x差为偶数的数。（这需要一点脑洞
因为x+n与x-n的差肯定是个偶数，而1~n的和包含了从2，4，6，8一直到n的所有偶数，所以只要找到离x最近的差为偶数的 1~n和，就是答案了。

说的比较乱，不懂的话可以自己写1到10的例子走一下就明白了。

附ac代码：

#include <cstdio>
#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <vector>
using namespace std;
const int maxn = 1e6+10;
typedef long long ll;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const double eps=1e-6;
ll ans[maxn];
ll l[maxn];
ll r[maxn];
int main() {
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    n=abs(n);
    if(n==0)
    {
        cout<<0<<endl;
        return 0;
    }
    for(int i=1;i<=1e9;++i)
    {
        ll s=i*(i+1)/2;
        if(s==n)
        {
            cout<<i<<endl;
            break;
        }
        else if(s>n &&(s-n)%2==0)
        {
            cout<<i<<endl;
            break;
        }
    }
    return 0;
}