#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for(int i=0;i<(n);i++) #define Inf 1000000000000000000 int n; vector x,y; long long get2(long long mx,long long my){ long long ret= 0; rep(i,n){ ret += abs(x[i] - mx) * abs(y[i] - my); } return ret; } long long get(long long m){ long long l = 0,r = 1000000; while(r-l>2){ long long m0 = l + (r-l)/3; long long m1 = m0 + (r-l)/3; if(get2(m,m0)<=get2(m,m1))r = m1; else l = m0; } long long ret = Inf; for(long long i=l-2;i<=r+2;i++){ ret = min(ret,get2(m,i)); } return ret; } int main(){ cin>>n; x.resize(n); y.resize(n); rep(i,n)cin>>x[i]>>y[i]; long long l = 0,r = 1000000; while(r-l>2){ long long m0 = l + (r-l)/3; long long m1 = m0 + (r-l)/3; if(get(m0)<=get(m1))r = m1; else l = m0; } long long ans = Inf; for(long long i=l-3;i<=r+3;i++)ans = min(ans,get(i)); cout<