#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#define rep(i ,n) for(int i=0;i<(int)(n);++i)
#define repr(i ,n) for(int i=n;i>(int)(n);--i)
#define rep1(i ,n) for(int i=1;i<=(int)(n);++i)
#define ALL(a) a.begin(), a.end()
#define RSORT(a) sort(ALL(a),greater<>())
#define SORT(a) sort(ALL(a))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define PRINT(x) printf("%d\n",(x));
#define ENDL printf("\n");
using namespace std;
typedef long long int i64;
typedef unsigned long long u64;
template<class T> using V = vector<T>;
using VI = V<int>;
const int INF = 2e9;
const i64 MOD = 1e9 + 7;

template <class T> inline bool chmin(T& a, T b){if(a>b){a=b; return true;} return false;}
template <class T> inline bool chmax(T& a, T b){if(a<b){a=b; return true;} return false;}

signed main(){
    int a , b , c; cin >> a >> b >> c;
    int counter1 = 0 , counter2 = 0;
    if( b > a && a > c){
        for( int i = a ; i != c ; --i ){
            ++counter1; 
        }
        for( int i = b ; i >= a ; --i){
            ++counter2;
        }
        chmin( counter1 , counter2 );
    } else if ( a > b && c > a){
        for( int i = c ; i != a ; --i){
            ++counter1;
        }
        for( int i = a ; i >= b ; --i){
            ++counter2;
        }
        chmin(counter1 , counter2);
    } else if ( a < c && c > b ){
        for( int i = a ; i >= c ; --i){
            ++counter1;
        }
        for( int i = c ; c > b ; --i){
            ++counter2;
        }
        chmin( counter1 , counter2);
    } else if ( c > a && c < b ){
        for( int i = c ; i >= a ; --i){
            ++counter1;
        }
        for( int i = c ; i > a ; -- i){
            ++counter2;
        }
        chmin( counter1 , counter2);
    }
    PRINT(counter1);
}