I can do it!

Given n elements, which have two properties, say Property A and Property B. For convenience, we use two integers A_i and B_i to measure the two properties.
Your task is, to partition the element into two sets, say Set A and Set B , which minimizes the value of max_{(x∈Set A)} {A_x}+max_{(y∈Set B)} {B_y}.
See sample test cases for further details.

There are multiple test cases, the first line of input contains an integer denoting the number of test cases.
For each test case, the first line contains an integer N, indicates the number of elements. (1 <= N <= 100000)
For the next N lines, every line contains two integers A_i and B_i indicate the Property A and Property B of the ith element. (0 <= A_i, B_i <= 1000000000)

For each test cases, output the minimum value.

1
3
1 100
2 100
3 1

Case 1: 3

HyperHexagon

HyperHexagon's Summer Gift (Original tasks)