#include <bits/stdc++.h>
using namespace std;
long long minDissatisfaction(vector<long long> a, vector<long long> b){
long long n = a.size();
vector<long long> A(n); // will contain (ai - bi)
long long sum = 0;
for (int i = 0; i < n; i++){
A[i] = a[i] - b[i];
sum = sum + (b[i]*n - a[i]);
}
sort(A.begin(), A.end(), greater<long long>());
for (int j = 0; j < n; j++){
sum += (A[j] * (j+1));
}
return sum;
}
int main() {
// your code goes here
long long n; cin >> n;
vector<long long> a(n);
vector<long long> b(n);
for (int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
cout << minDissatisfaction(a, b);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpsb25nIGxvbmcgbWluRGlzc2F0aXNmYWN0aW9uKHZlY3Rvcjxsb25nIGxvbmc+IGEsIHZlY3Rvcjxsb25nIGxvbmc+IGIpewoJbG9uZyBsb25nIG4gPSBhLnNpemUoKTsKCXZlY3Rvcjxsb25nIGxvbmc+IEEobik7IC8vIHdpbGwgY29udGFpbiAoYWkgLSBiaSkKCWxvbmcgbG9uZyBzdW0gPSAwOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspewoJCUFbaV0gPSBhW2ldIC0gYltpXTsKCQlzdW0gPSBzdW0gKyAoYltpXSpuIC0gYVtpXSk7Cgl9CgkKCXNvcnQoQS5iZWdpbigpLCBBLmVuZCgpLCBncmVhdGVyPGxvbmcgbG9uZz4oKSk7CgkKCWZvciAoaW50IGogPSAwOyBqIDwgbjsgaisrKXsKCQlzdW0gKz0gKEFbal0gKiAoaisxKSk7Cgl9CgkKCXJldHVybiBzdW07Cn0KCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJbG9uZyBsb25nIG47IGNpbiA+PiBuOwoJdmVjdG9yPGxvbmcgbG9uZz4gYShuKTsKCXZlY3Rvcjxsb25nIGxvbmc+IGIobik7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJY2luID4+IGFbaV0gPj4gYltpXTsKCX0KCQoJY291dCA8PCBtaW5EaXNzYXRpc2ZhY3Rpb24oYSwgYik7CglyZXR1cm4gMDsKfQ==