#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;

#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()


template <typename _KTy, typename _Ty>
ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) {
	cout << "{" << m.first << ", " << m.second << "}";
	return ostr;
}

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

template <typename _Ty>
ostream& operator << (ostream& ostr, const set<_Ty>& s) {
	if (s.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << *(s.begin());
	for (auto itr = ++s.begin(); itr != s.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

int yuki0126() 
{
	int A, B, S;
	cin >> A >> B >> S;
	
	// A が来る
	if (S == 1 || abs(S - A) <= abs(S - B)) {
		// A が S で客を乗せて 0 まで降りる
		cout << abs(S - A) + S << endl;
	}
	// B が来る
	else {
		// A が地下
		if (A == 0) {
			// B が S で客を乗せて 1 まで移動，A が 0 と 1 を往復
			cout << abs(S - B) + abs(S - 1) + 2 << endl;
		}
		// A が地上
		else {
			// B が S で客を乗せて A まで移動，A で 0 まで降りる
			cout << abs(S - B) + abs(S - A) + A << endl;
		}
	}

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0126();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}