Untitled

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e6+3;
const int MOD=1e9+7;
int n,a[N],b[N];
ll tinh(int a[])
{
    ll s=0,t=0;
    f(i,2,n) s+=1ll*(i-1)*a[i];
    f1(i,n-1) t+=1ll*(n-i)*a[i];
    return s-t;
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  cin>>n;
  f1(i,n) cin>>a[i]>>b[i];
  sort(a+1,a+n+1);
  sort(b+1,b+n+1);
  cout<<tinh(a)+tinh(b);
}
//-----YEU CODE HON CRUSH-----//