#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 ;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBsb25nIGxvbmcgbGw7CiNkZWZpbmUgaW50IGxsCmNvbnN0IGludCBOID0gMWU2ICsxMDAgOwp2ZWN0b3I8cGFpcjxpbnQsaW50Pj4gdihOKSA7IAppbnQgc2EgPSAwIDsgaW50IHNiID0gMCA7CmludCBuIDsKaW50IGNvc3QoaW50IHgpIHsKICAgIGludCBEID0gMDsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIEQgKz0gbWF4KDBMTCwgdltpXS5maXJzdCArIHZbaV0uc2Vjb25kIC0geCk7CiAgICB9CgogICAgaW50IEUgPSBtYXgoMExMLCBzYSAtIHgpICsgbWF4KDBMTCwgc2IgLSB4KTsKCiAgICByZXR1cm4gMiAqIG1heChELCBFKSArIDIgKiB4IC0gc2EgLSBzYjsKfQoKc2lnbmVkIG1haW4oKXsgICAKCWlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShOVUxMKTsKICAgICBjaW4gPj4gbiA7IAogICAgCiAgIAogICAgZm9yKGludCBpID0gMCA7IGkgPCBuIDsgaSsrKXsKICAgIAljaW4gPj4gdltpXS5maXJzdCA+PiB2W2ldLnNlY29uZCA7IAogICAgCXNhICs9IHZbaV0uZmlyc3QgOyAKICAgIAlzYiArPSB2W2ldLnNlY29uZDsKICAgIH0KICAgIGludCBsID0gMCA7IGludCByID0gMWUxMyA7IAogICAgd2hpbGUoIGwgPCByKXsKICAgIAlpbnQgbSA9IChsICsgcikvMiA7IAogICAgCWlmKGNvc3QobSkgPCBjb3N0KG0rMSkpewogICAgCQlyID0gbSA7IAogICAgCX1lbHNlewogICAgCQlsID0gbSArIDEgOyAKICAgIAl9CiAgICB9CiAgICAKICAgIGludCBhbnMgPSBtaW4oY29zdChsKSAsIGNvc3QobCsxKSkgOyAKICAgIGlmKGwgPiAwKSBhbnMgPSBtaW4oYW5zICwgY29zdChsLTEpKSA7IAogICAgY291dCA8PCBhbnMgPDwgZW5kbCA7Cn0=