CF11B.Jumping Jack

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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$ .

输入格式

The input data consists of only one integer $x$ ( $-10^{9}<=x<=10^{9}$ ).

输出格式

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

输入输出样例

输入#1
```
2
```
输出#1
```
3
```
输入#2
```
6
```
输出#2
```
3
```
输入#3
```
0
```
输出#3
```
0
```

首页