Strongest Friend Index

Given N friends and their respective carrying capacities, determine the friend who can carry the most weight. The carrying capacities are provided as a sequence of integers. In case of a tie, return the friend with the smallest index (using 1-based indexing). This problem requires you to read input from standard input (stdin) and output the result to standard output (stdout).

inputFormat

The input consists of two lines. The first line contains a single integer N, the number of friends. The second line contains N space-separated integers, each representing the carrying capacity of a friend.

outputFormat

Output a single integer which is the 1-based index of the friend with the highest carrying capacity. In the event of multiple friends having the same highest capacity, the smallest index should be returned.

1
50

1