#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int A,B,S;
int dp[102][102][102];

void solve() {
	int i,j,k,l,r,x,y; string s;
	cin>>A>>B>>S;
	
	/*
	FOR(i,101) FOR(x,101) FOR(y,101) dp[i][x][y]=100000;
	dp[A][B][S]=0;
	queue<int> q;
	q.push(A*40000+B*200+S);
	while(q.size()) {
		int k=q.top();
		q.pop();
		x=k%40000;
		y=k/200%200;
		i=k%200;
		if(S==0) return _P("%d\n",dp[x][y][i]);
	}
	*/
	
	if(abs(A-S)<=abs(B-S)) {
		cout<<abs(A-S)+S<<endl;
	}
	else {
		x=abs(B-S);
		if(A>S) {
			x+=min(A-S+A,(S-1)+A);
		}
		else if(A==0) {
			x+=(S-1)+2;
		}
		else x+=S;
		cout<<x<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}