import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum K = 100;

void main() {
  int[] xs, ys;
  xs ~= 0;
  ys ~= 0;
  foreach (_; 0 .. K) {
    foreach (dx; [2, 2, -1, -1, 2, -1, -1]) {
      xs ~= xs[$ - 1] + dx;
      ys ~= ys[$ - 1] + abs(dx);
    }
  }
  const xsLen = cast(int)(xs.length);
  debug {
    writeln("xs = ", xs);
  }
  
  try {
    for (; ; ) {
      const X = readInt;
      
      int ans = -1;
      foreach (i; 0 .. xsLen) {
        if (xs[i] == X) {
          ans = i;
          break;
        }
      }
      writeln(ys[ans]);
    }
  } catch (EOFException e) {
  }
}