Rigged!
Monocarp organizes a weightlifting competition. There are $$$n$$$ athletes participating in the competition, the $$$i$$$-th athlete has strength $$$s_i$$$ and endurance $$$e_i$$$. The $$$1$$$-st athlete is Monocarp's friend Polycarp, and Monocarp really wants Polycarp to win.The competition will be conducted as follows. The jury will choose a positive (greater than zero) integer $$$w$$$, which denotes the weight of the barbell that will be used in the competition. The goal for each athlete is to lift the barbell as many times as possible. The athlete who lifts the barbell the most amount of times will be declared the winner (if there are multiple such athletes — there's no winner).If the barbell's weight $$$w$$$ is strictly greater than the strength of the $$$i$$$-th athlete $$$s_i$$$, then the $$$i$$$-th athlete will be unable to lift the barbell even one single time. Otherwise, the $$$i$$$-th athlete will be able to lift the barbell, and the number of times he does it will be equal to his endurance $$$e_i$$$.For example, suppose there are $$$4$$$ athletes with parameters $$$s_1 = 7, e_1 = 4$$$; $$$s_2 = 9, e_2 = 3$$$; $$$s_3 = 4, e_3 = 6$$$; $$$s_4 = 2, e_4 = 2$$$. If the weight of the barbell is $$$5$$$, then:  the first athlete will be able to lift the barbell $$$4$$$ times;  the second athlete will be able to lift the barbell $$$3$$$ times;  the third athlete will be unable to lift the barbell;  the fourth athlete will be unable to lift the barbell. Monocarp wants to choose $$$w$$$ in such a way that Polycarp (the $$$1$$$-st athlete) wins the competition. Help him to choose the value of $$$w$$$, or report that it is impossible.
The first test case of the example is described in the statement.
The first line contains one integer $$$t$$$ ($$$1 \le t \le 100$$$) — the number of test cases.The first line of each test case contains one integer $$$n$$$ ($$$2 \le n \le 100$$$) — the number of athletes. Then $$$n$$$ lines follow, the $$$i$$$-th of them contains two integers $$$s_i$$$ and $$$e_i$$$ ($$$1 \le s_i \le 10^9$$$; $$$1 \le e_i \le 100$$$) — the strength and the endurance of the $$$i$$$-th athlete.
For each test case, print the answer as follows:  if the answer exists, print one integer — the value of $$$w$$$ meeting the constraints. The integer you print should satisfy $$$1 \le w \le 10^9$$$. It can be shown that if the answer exists, at least one such value of $$$w$$$ exists as well. If there are multiple answers, you can print any of them;  otherwise, print one integer $$$-1$$$. 
import sys

def II():
    return int(sys.stdin.readline())

def LI():
    return [int(num) for num in sys.stdin.readline().split()]

def SI():
    return sys.stdin.readline().rstrip()

def func():
    n = II()
    s_e = []
    for __ in range(n):
        s_e.append(LI())
    ans = s_e[0][0]
    endur = s_e[0][1]
    for pair in s_e[1:]:
        if pair[0] >= ans and pair[1] >= endur:
            return -1
    return ans
for _ in range(II()):
    print(func())
import sys
sys.setrecursionlimit(int(1000000000.0))
input = lambda : sys.stdin.readline().strip()
write = lambda x: sys.stdout.write(str(x) + '\n')

def solve():
    n = int(input())
    s = [-1] * n
    e = [-1] * n
    for i in range(n):
        (s[i], e[i]) = map(int, input().split(' '))
    win = True
    for i in range(1, n):
        if s[i] >= s[0] and e[i] >= e[0]:
            win = False
    write(s[0] if win else -1)

def main():
    t = int(input())
    for _ in range(t):
        solve()
main()
import time
a = []
res = []

def solt1():
    n = int(input('')) - 1
    (w, e) = map(int, input().split())
    for j in range(n):
        (w1, e1) = map(int, input().split())
        if w > w1:
            pass
        elif e > e1:
            pass
        else:
            w = -1
    return w
if __name__ == '__main__':
    t = int(input(''))
    for i in range(t):
        print(solt1())