#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> a(n),b(n);
    ll as = 0, bs = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
        as += a[i];
        bs += b[i];
    }
    ll res = 0;
    for (int i = 0; i < n; ++i) {
        as -= a[i];
        bs -= b[i];
        res += max(a[i]*bs, b[i]*as);
    }
    cout << res << endl;
}