#include #define REP(i, n) for(int i = 0;i < n;i++) #define VSORT(v) sort(v.begin(), v.end()) #define VRSORT(v) sort(v.rbegin(), v.rend()) #define ll long long using namespace std; typedef pair P; typedef pair LP; typedef pair PP; typedef pair LPP; //typedef vectorvec; //typedef vectorvec; //typedef vector mat; typedef vector> Graph; //const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; //const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; const int INF = 1000000000; const ll LINF = 1000000000000000000;//1e18 const ll MOD = 1000000007; const double PI = acos(-1.0); const double EPS = 1e-10; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;}; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll A, B, C; cin >> A >> B >> C; if((A < B && B < C) || (C < B && B < A)) cout << 0 << endl; else cout << min({abs(A-C), abs(A-B), abs(B-C)}) << endl; }