Grocery Shopping

Hyeseon eats crab sticks often, so she went to a mart near her home to buy some. Standing in front of the food aisle, she ran into a problem. Each brand puts a different weight in a bag at a different price, so it was not obvious which bag would let her eat the most for the same money.

Hyeseon wrote down the weight $W$ in grams and the price $C$ in won printed on every bag on display, and decided to buy the one with the largest weight per won, that is, the one with the largest $W / C$. Write a program that finds the price of the crab sticks Hyeseon should buy.

Input is read from standard input. The first line contains the number of test cases $T$ ($1 \le T \le 20$).

The first line of each test case contains the number of crab stick kinds $N$. Each of the next $N$ lines contains the weight $W$ in grams and the price $C$ in won of one kind, in that order, separated by a single space. ($1 \le N \le 100$, $1 \le W \le 5000$, $1 \le C \le 100000$, and $W$ and $C$ are integers.)

Output is written to standard output. For each test case, print the price of the crab sticks Hyeseon should buy, one per line. If two or more kinds tie for the largest weight per won, she buys the cheapest one among them.