cho.sh
Notes
Loading...

Maximum Value

Time limit

1s

Memory limit

128 MB

Problem

Given nine distinct natural numbers, find the largest value and the 1-based position at which it appears in the input.

Input

Nine lines are given. Each line contains one natural number. All numbers are distinct and less than 100.

Output

Print the maximum value on the first line. Print its 1-based position in the input on the second line.