#P1047B. Cover Points

Cover Points

No submission language available for this problem.

Description

There are nn points on the plane, (x1,y1),(x2,y2),,(xn,yn)(x_1,y_1), (x_2,y_2), \ldots, (x_n,y_n).

You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the triangle). Calculate the minimum length of the shorter side of the triangle.

First line contains one integer nn (1n1051 \leq n \leq 10^5).

Each of the next nn lines contains two integers xix_i and yiy_i (1xi,yi1091 \leq x_i,y_i \leq 10^9).

Print the minimum length of the shorter side of the triangle. It can be proved that it's always an integer.

Input

First line contains one integer nn (1n1051 \leq n \leq 10^5).

Each of the next nn lines contains two integers xix_i and yiy_i (1xi,yi1091 \leq x_i,y_i \leq 10^9).

Output

Print the minimum length of the shorter side of the triangle. It can be proved that it's always an integer.

Samples

Sample Input 1

3
1 1
1 2
2 1

Sample Output 1

3

Sample Input 2

4
1 1
1 2
2 1
2 2

Sample Output 2

4

Note

Illustration for the first example:

Illustration for the second example: