You are given 'n' inequalities. Each inequality is of one of the following 4 types:

1. Type 1: x > v
2. Type 2: x < v
3. Type 3: x = v
4. Type 4: x ≠ v

where 'x' is a variable which can only take non-negative integral values.

Your task is to find the maximum number of inequalities which are satisfied for some value of 'x'. You are also required to find the minimum value of 'x' for which the maximum number of inequalities are satisfied.

Input

The first line of input contains a single integer 'n', denoting the total number of inequalities. Each of the next 'n' lines contain 2 space separated integers t_i and v_i. t_i denotes the type of inequality and v_i denotes the value on the right hand side of the inequality.

Output

Output two space separated integers, the first integer denoting the maximum number of inequalities which are satisfied for some value of 'x', and the second integer denoting the minimum value of 'x' for which the maximum number of inequalities are satisfied.

Example

Input:
4
1 10
2 9
3 7
4 4

Output:
3 7

Constraints

1 ≤ n ≤ 100000

1 ≤ t_i ≤ 4

1 ≤ v_i ≤ 10¹⁸

Explanation

The given inequalities are:

1. x > 10,
2. x < 9,
3. x = 7,
4. x ≠ 4.

For x=7, the inequalities 2, 3 and 4 are satisfied.