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 N = 101;
enum INF = 10^^9;

void main() {
  try {
    for (; ; ) {
      const A = readInt();
      const B = readInt();
      const S = readInt();
      
      alias Entry = Tuple!(int, "c", int, "a", int, "b", int, "s");
      BinaryHeap!(Array!Entry, "a > b") que;
      auto dist = new int[][][](N, N, N);
      foreach (a; 0 .. N) foreach (b; 0 .. N) {
        dist[a][b][] = INF;
      }
      dist[A][B][S] = 0;
      que.insert(Entry(0, A, B, S));
      for (; !que.empty; ) {
        const c = que.front.c;
        const a = que.front.a;
        const b = que.front.b;
        const s = que.front.s;
        que.removeFront;
        if (dist[a][b][s] == c) {
          if (s == 0) {
            writeln(c);
            goto found;
          }
          // up
          if (abs(a - s) <= abs(b - s)) {
            foreach (ss; s + 1 .. N) {
              const cc = c + abs(a - s) + abs(s - ss);
              if (chmin(dist[ss][b][ss], cc)) {
                que.insert(Entry(cc, ss, b, ss));
              }
            }
          } else {
            foreach (ss; s + 1 .. N) {
              const cc = c + abs(b - s) + abs(s - ss);
              if (chmin(dist[a][ss][ss], cc)) {
                que.insert(Entry(cc, a, ss, ss));
              }
            }
          }
          // down
          if (s == 1 || abs(a - s) <= abs(b - s)) {
            foreach (ss; 0 .. s) {
              const cc = c + abs(a - s) + abs(s - ss);
              if (chmin(dist[ss][b][ss], cc)) {
                que.insert(Entry(cc, ss, b, ss));
              }
            }
          } else {
            foreach (ss; 0 .. s) {
              const cc = c + abs(b - s) + abs(s - ss);
              if (chmin(dist[a][ss][ss], cc)) {
                que.insert(Entry(cc, a, ss, ss));
              }
            }
          }
        }
      }
      assert(false);
     found:
    }
  } catch (EOFException e) {
  }
}