#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector <int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }

    vector <int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&](int i, int j) {
        return a[i] * b[j] > b[i] * a[j];
    });

    vector <long long> pre(n + 1), suf(n + 1);
    vector <long long> sa(n + 1), sb(n + 1);
    for (int i = 0; i < n; ++i) {
        int id = ord[i];
        pre[i + 1] = pre[i] + sa[i] * b[id];
        sa[i + 1] = sa[i] + a[id];
    }
    for (int i = n - 1; ~i; --i) {
        int id = ord[i];
        suf[i] = suf[i + 1] + sb[i + 1] * a[id];
        sb[i] = sb[i + 1] + b[id];
    }

    long long ans = 0;
    for (int i = 0; i < n; ++i) {
        ans = max(ans, pre[i] + suf[i + 1] + sa[i] * sb[i + 1]);
    }

    cout << ans << '\n';
}