A. Get to the Choppa!
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Arnold, in his many roles, has opened up an ice pop factory! He makes ice pops by creating a big batch of fresh fruit slurry, freezing it, and then slicing it into individual servings using the ice choppa (pronounced "chaw-pah".)

However, he is worried that the ice blocks will melt before getting to the choppa! In particular, different flavors of ice pops will take a different amount of time to melt, so he needs to prioritize the ice blocks that will melt first.

Given a list of flavors and the time each flavored ice block takes to melt, output in what order Arnold should send the ice blocks to the choppa!

Input

The first line contains a single integer $$$N\ (1 \le N \le 10^5)$$$, denoting the number of flavored ice blocks.

The next $$$N$$$ lines contain an integer $$$a_i$$$ and a word $$$s_i$$$, separated by a space. The word $$$s_i$$$ denotes the flavor of the $$$i$$$th ice block, and the integer denotes how many minutes it will take for the $$$i$$$th ice block to melt $$$(1 \le a_i \le 10^9, N \leq \sum_{i=1}^N|s_i| \leq 2 \cdot 10^6)$$$.

It is guaranteed that all flavors will be distinct, and all times taken to melt will be distinct.

Output

Print out a single line with the flavors of the ice blocks, ordered by time taken to melt.

Example
Input
4
3 Pineapple
4 Grape
19 Strawberry
12 Lime
Output
Pineapple Grape Lime Strawberry