#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

const int mod = 1000000007;
const int INF = (int)1e9;
const ll LLINF = (ll)2e18;
const double PI = 3.1415926536;

const int SIZE = 1000;

int main(){
    int a,b,s,ans;
    
    scanf("%d%d%d",&a,&b,&s);
    
    if(a==0){
        if(s==1){
            ans = 2;
        }else{
            if(abs(s-a)<=abs(s-b)){
                ans = abs(s-a)*2;
            }else{
                ans = 2 + abs(s-b) + b-1;
            }
        }
    }else if(abs(s-a)<=abs(s-b)){
        ans = abs(s-a) + s;
    }else{
        ans = abs(s-b) + abs(s-a) + a;
    }
    
    printf("%d\n",ans);
    
    return 0;
}