#include<stdio.h>
typedef long long lld;

inline int g(int x) {
    int le = 1, ri = x, ans = ri;
    x += x;
    while (le <= ri) {
        lld mid = (le + ri) >> 1;
        if (mid * (mid + 1) >= x) ans = mid, ri = mid - 1;
        else le = mid + 1;
    }
    if (x == (lld)(ans)*(ans+1)) return ans;
    else --ans;
    x /= 2;
    int sum = ((lld)(ans))*(ans+1)/2;
    return ans%2 ? (x-sum)%2+ans+1 : -2*((x-sum)%2)+ans+3;
}

int main()
{
    int n;
    scanf("%d", &n);
    printf("%d\n", g(n<0?-n:n));
    return 0;
}