Sum

Problem Description

Consider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we can obtain S by associating signs for all numbers between 1 to N.

For a given S, find out the minimum value N in order to obtain S according to the conditions of the problem.

Input

The only line contains in the first line a positive integer S (0< S <= 100000) which represents the sum to be obtained.

Output

The output will contain the minimum number N for which the sum S can be obtained.

Sample Input

12

Sample Output

7

题目大意：对于连续自然数，对其做+或-运算，求最少运算次数得到所得数

解题思路：S=i*(i+1)/2,每做一次减运算都相当比原先那个数少个偶数。即
(S-n)%2==0即可。

代码：

#include<stdio.h>
#include<math.h>
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int i,sum;
        for(i=1;i<=n ;i++)
        {
            sum=(i+1)*i/2;
            if(sum>=n&&(sum-n)%2==0)
            {
                printf("%d\n",i);
                break;
            }
        }
    }
}