#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int N = 1e6 +100 ;
vector<pair<int,int>> v(N) ; 
int sa = 0 ; int sb = 0 ;
int n ;
int cost(int x) {
    int D = 0;

    for (int i = 0; i < n; i++) {
        D += max(0LL, v[i].first + v[i].second - x);
    }

    int E = max(0LL, sa - x) + max(0LL, sb - x);

    return 2 * max(D, E) + 2 * x - sa - sb;
}

signed main(){   
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
     cin >> n ; 
    
   
    for(int i = 0 ; i < n ; i++){
    	cin >> v[i].first >> v[i].second ; 
    	sa += v[i].first ; 
    	sb += v[i].second;
    }
    int l = 0 ; int r = 1e13 ; 
    while( l < r){
    	int m = (l + r)/2 ; 
    	if(cost(m) < cost(m+1)){
    		r = m ; 
    	}else{
    		l = m + 1 ; 
    	}
    }
    
    int ans = min(cost(l) , cost(l+1)) ; 
    if(l > 0) ans = min(ans , cost(l-1)) ; 
    cout << ans << endl ;
}