#include <cstdio>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int N;
 
long long S;
 
vector< pair<long long, long long> > towns;
// .first : X[i]
// .second : A[i]
 
int main() {
    scanf("%d", &N);
    for (int i = 0; i < N; i++) {
        long long x, a;
        scanf("%lld %lld", &x, &a);
        towns.emplace_back(x, a);
 
        S += a;
    }
 
    sort(towns.begin(), towns.end());
 
    long long T = 0;
    for (int i = 0; i < N; i++) {
        T += towns[i].second;
        if (T * 2 >= S) {
            printf("%lld\n", towns[i].first);
            break;
        }
    }
    return 0;
}

I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPGFsZ29yaXRobT4KIAp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCmludCBOOwogCmxvbmcgbG9uZyBTOwogCnZlY3RvcjwgcGFpcjxsb25nIGxvbmcsIGxvbmcgbG9uZz4gPiB0b3duczsKLy8gLmZpcnN0IDogWFtpXQovLyAuc2Vjb25kIDogQVtpXQogCmludCBtYWluKCkgewogICAgc2NhbmYoIiVkIiwgJk4pOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBOOyBpKyspIHsKICAgICAgICBsb25nIGxvbmcgeCwgYTsKICAgICAgICBzY2FuZigiJWxsZCAlbGxkIiwgJngsICZhKTsKICAgICAgICB0b3ducy5lbXBsYWNlX2JhY2soeCwgYSk7CiAgICAgICAgIAogICAgICAgIFMgKz0gYTsKICAgIH0KIAogICAgc29ydCh0b3ducy5iZWdpbigpLCB0b3ducy5lbmQoKSk7CiAKICAgIGxvbmcgbG9uZyBUID0gMDsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgaSsrKSB7CiAgICAgICAgVCArPSB0b3duc1tpXS5zZWNvbmQ7CiAgICAgICAgaWYgKFQgKiAyID49IFMpIHsKICAgICAgICAgICAgcHJpbnRmKCIlbGxkXG4iLCB0b3duc1tpXS5maXJzdCk7CiAgICAgICAgICAgIGJyZWFrOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiAwOwp9