Go to Jinju! (Easy)

This problem is the same as "Jinju Let's Go! (Hard)" except for the range of the input numbers.

Bosun, a Gyeongsang National University graduate worn out by life in Seoul, missed his college days and wanted to visit Jinju, where the university is. So Bosun went straight to the Seoul bus terminal to take a day trip to Jinju.

The Seoul terminal has $N$ transport options. Each option has a destination and a fare, and all destinations are different. The destination jinju is always among them, and it marks the option that goes to Jinju.

Bosun is tired and does not want to check all $N$ options. Bosun asks you to find the fare to Jinju and the number of options that cost more than it.

The first line contains $N$, the number of transport options at the Seoul terminal. ($1 \le N \le 1000$)

Each of the next $N$ lines contains the destination $D_i$ and the fare $C_i$ of the $i$-th option, separated by a space. $D_i$ is a string of lowercase English letters with length from 1 to 15. Exactly one $j$ has $D_j =$ jinju, and that option goes to Jinju. ($1 \le C_i \le 1000$)

All numbers in the input are integers.

The first line prints the fare of the option going to Jinju.

The second line prints the number of options that cost more than the option going to Jinju.