Sobytiynyy Proyekt Casino Gym - 102299I

传送门：

http://codeforces.com/gym/102299/problem/I

Sobytiynyy Proyekt Casino is located in San Petersburg, one of the most beautiful cities in Russia, known (besides being where ITMO is located) by its delightful Hermitage Museum. The casino's owner, a former ICPC contestant who never made it to the world finals, is creating a new game (as the traditional games are not appreciated there...) and he wants revenge on his fellow competitors, by punishing players who are trying to play his game optimally.

In each round, the players get a pair of integers (p,f)(p,f), where p>0p>0. The player gets (p) rubles and he or she may decide to leave the game by paying (f) rubles (or receiving (-f) rubles, if (f) is negative). Depending on how they play, players may end the game while owing money...

Note also that if the player reaches the last pair, he is forced to pay (f_N).

Help the casino's owner by finding an ordering of the (N) pairs which minimize the gains from a player who plays optimally. Your code must print how much the player would earn if she played in the ordering of pairs that minimizes her gain.

Input

You should read the number (N) of pairs in the first line of input.

After this (N) lines will follow, each with two numbers separated by a space, pp and ff.

Constraints

• 1≤N≤1051≤N≤105
• 0≤pi≤1090≤pi≤109 for all ii
• −109≤fi≤109−109≤fi≤109 for all ii

Output

Print a single integer: how much an optimal player would gain in an ordering of pairs that minimizes her gain.

Examples

Input

3
1 2
3 3
2 1

Output

3

Input

1
1 -2

Output

3

Input

2
0 1
3 4

Output

-1

Note

Let us analyze the possible permutations of the sequence of pairs for the first case:

Both permutations (1,2),(3,3),(2,1)(1,2),(3,3),(2,1) and (3,3),(1,2),(2,1)(3,3),(1,2),(2,1) award 5 to an optimal player. The permutations (2,1),(3,3),(1,2)(2,1),(3,3),(1,2) and (3,3),(2,1),(1,2)(3,3),(2,1),(1,2) award at most 4.

Finally, the permutations (1,2),(2,1),(3,3)(1,2),(2,1),(3,3) and (2,1),(1,2),(3,3)(2,1),(1,2),(3,3) award at most 3 to a player. Thus, 3 is the smallest value that an optimal player can get in this game.

#include <bits/stdc++.h>

using namespace std;

struct node
{
    long long l ,r;
}str[100005];

bool cmp(node a, node b)
{
    return a.r<b.r;
}

int main()
{
    long long n;
    scanf("%lld", &n);
    for(long long i=0;i<n;i++)
    {
        scanf("%lld %lld", &str[i].l, &str[i].r);
    }
    sort(str, str+n, cmp);
    long long tot = str[0].l;
    long long maxx = tot - str[0].r;
    
    for(long long i=1;i<n;i++)
    {
        tot += str[i].l;
        maxx = max(maxx, tot-str[i].r);
    }
    printf("%lld\n", maxx);
    return 0;
}