문제

Mirko quickly got tired of Jetpack Joyride and started playing Pokémon GO! on his phone. One of the curiosities of this game is the so-called evolution of Pokémon. In order to evolve Pokémon of species $P_{i}$, Mirko must provide $K_{i}$ candy intended for a Pokémon of that species. After the evolution of that Pokémon, he gets 2 candies back. Pokémon can evolve only with the help of candy intended for their species. Mirko has N species of Pokémon and $M_{i}$ candy for Pokémon of species $P_{i}$ and wants to know how many total Pokémon he can evolve. He also wants to know which Pokémon can evolve the most number of times. If there are multiple such Pokémon, output the one with the smallest Pokédex number. In other words, the one that appears earliest in the input data.

입력

The first line of input contains the integer N (1 ≤ N ≤ 70), the number of Pokémon species. The following 2 N lines contains N sets of data, wherein it holds: ● line 2 i contains string $P_{i}$, 20 characters long at most, the name of the i-th Pokémon species; ● line 2 i +1 contains integers $K_{i}$ (12 ≤ $K_{i}$ ≤400) and $M_{i}$ (1 ≤ $M_{i}$ ≤ $10^{4}$), the number of candy necessary for the evolution of one Pokémon of the i-th species and the total number of candy Mirko has for Pokémon of the i-th species

출력

The first line of output must contain the total number of Pokémon that Mirko can evolve. The second line of output must contain the name of the Pokémon that can evolve the most number of times.

채점

In test cases worth 16 points total, it will hold N = 3. The first line of output will count towards 50% of points for that test case. The second line of output will count towards 50% of points for that test case.

예제 입력 1

4
Caterpie
12 33
Weedle
12 42
Pidgey
12 47
Rattata
25 71

예제 출력 1

14
Weedle

예제 입력 2

7
Bulbasaur
25 74
Ivysaur
100 83
Charmander
25 116
Charmeleon
100 32
Squirtle
25 1
Wartortle
100 173
Pikachu
50 154

예제 출력 2

11
Charmander