#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100007], b[100007];
ll pre[100007], suf[100007];
priority_queue<int, vector<int>, greater<int>> q1;
priority_queue<ll, vector<ll>, greater<ll>> q2;
struct node
{
    ll a;
    ll b;
} c[100007];
bool operator<(node a, node b)
{
    return a.a - a.b > b.a - b.b;
}
inline ll check(int n, int k) // 判断是否满足哈密顿
{
    if (k == 0 || k * 2 > n)
    {
        return 0x8000000000000000ll;
    }
    ll cur = 0, ans = 0x8000000000000000ll;
    while (!q1.empty())
        q1.pop();
    for (int i = 1; i <= n; i++)
    {
        cur += c[i].a;
        q1.push(c[i].a);
        if (i > k)
        {
            cur -= q1.top();
            q1.pop();
        }
        pre[i] = cur;
    }
    cur = 0;
    while (!q2.empty())
        q2.pop();
    for (int i = n; i >= 1; i--)
    {
        cur += c[i].b;
        q2.push(c[i].b);
        if (i + k <= n)
        {
            cur -= q2.top();
            q2.pop();
        }
        suf[i] = cur;
    }
    for (int i = k; i + k <= n; i++)
    {
        ans = max(ans, pre[i] + suf[i + 1]);
    }
    return ans;
}
int main()
{
    int n, l = 0, r, pos;
    ll sum1 = 0, sum2 = 0;
    cin >> n;
    r = n / 2;
    // 权值为max(api−bpimodn+1,bpimodn+1−api)
    for (int i = 1; i <= n; i++)
    {
        int p, q;
        cin >> a[i] >> b[i];
        p = a[i] - b[i];
        sum1 += p;
        p = abs(p);
        sum2 += p; // 权值和
        q = a[i] + b[i];
        c[i].a = q - p;
        c[i].b = -(ll)q - p;
    }
    sort(c + 1, c + n + 1);
    // 二分
    while (l <= r)
    {
        int mid = (l + r) >> 1;
        if (check(n, mid) >= check(n, mid + 1))
        {
            r = mid - 1;
            pos = mid;
        }
        else
        {
            l = mid + 1;
        }
    }
    cout << max(llabs(sum1), check(n, pos) + sum2);
    return 0;
}