#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <climits>

using namespace std;

typedef long long int ll;

ll solve() {
    int n;
    cin>>n;
    vector<pair<int,int>> arr(n);
    for(int i=0;i<n;i++){
        cin>>arr[i].first;
        cin>>arr[i].second;
    }

    vector<ll> diff(n);
    
    for(int i=0;i<n;i++){
         diff[i] = arr[i].first - arr[i].second;
    }

    sort(diff.rbegin(),diff.rend());

    ll ans=0;
    ll sum_a=0;
    ll sum_b=0;



    for(int i=1;i<=n;i++){
        ans = ans+  diff[i-1]*i;
        sum_a = sum_a + arr[i-1].first;
        sum_b = sum_b + arr[i-1].second;

    }

    ll final_ans = ans + n*sum_b - sum_a;
    return final_ans;


}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);


        cout<<solve()<<endl;

    

    return 0;
}