#include using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<bool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(b ostream &operator<<(ostream &os,const vector&v){ for(int i=0;i<(int)v.size();i++) os< istream &operator>>(istream &is,vector&v){ for(T &x:v)is>>x; return is; } signed main(){ int n;cin>>n; vector a(n),b(n); rep(i,n) cin>>a[i]>>b[i]; if(n==1){ cout< ax,bx,ay,by; rep(i,n){ if(i%2==0){ ax.push_back(a[i]); bx.push_back(b[i]); }else{ ay.push_back(a[i]); by.push_back(b[i]); } } vector w; { int m=(int)ax.size(); rep(i,1<>j)&1)dif+=ax[j]; else dif-=bx[j]; } w.push_back(dif); } sort(ALL(w)); } ll res=LINF; { int m=(int)ay.size(); rep(i,1<>j)&1)dif+=ay[j]; else dif-=by[j]; } int idx=lower_bound(ALL(w),-dif)-begin(w); for(int j=max(0,idx-2);j