Stacking Cups

You are writing a cup stacking module for a robot. The robot carries several sensors that read the radius and the color of a cup exactly. The trouble is a defect in the core routine that processes sensor input: when the color signal arrives after the radius signal, the routine passes on twice the radius, that is, the diameter.

For a red cup of radius $5$, the module receives either red 5 or 10 red.

Given the list of messages sent by the core routine, where each message describes a different cup, sort the cups from the smallest to the largest.

The first line contains the number of cups $N$. ($1 \le N \le 20$)

Each of the next $N$ lines contains two tokens, either as color radius or as diameter color. The radius $R$ of a cup is a positive integer less than $1000$, and the diameter is $2R$. The color $C$ is a non-empty string of lowercase English letters of length at most $20$. All cups differ in both size and color.

Print the colors of the cups, one per line, in order of increasing radius.