Total Ripening Time

In this problem, you are given a list of trees. Each tree is described by two integers: F (the number of fruits on the tree) and T (the time required for each fruit to ripen). All fruits on the same tree ripen concurrently, so the time for a single tree to have all its fruits ripe is given by the formula \(F \times T\). Since the trees ripen in parallel, the overall ripening time for the orchard is equal to the maximum \(F \times T\) value among all trees.

Your task is to compute this maximum ripening time.

inputFormat

The input is read from standard input and is formatted as follows:

• The first line contains an integer n, the number of trees.
• Each of the next n lines contains two space-separated integers F and T, representing the number of fruits and the ripening time per fruit, respectively.

outputFormat

Output a single integer representing the maximum time required for any tree to have all its fruits ripe.

3
10 3
15 4
7 2

60