102750: [AtCoder]ABC275 A - Find Takahashi

Problem Statement

There are $N$ bridges in AtCoder Village. The height of the bridge numbered $i$ is $H_i$ ($i$ is an integer between $1$ and $N$).
Every two different bridges in the village have different heights.

Print the number representing the highest bridge in the village.

Constraints

• $1\leq N \leq 100$
• $1\leq H_i \leq 10^9$
• All $H_i$ are different.
• All values in the input are integers.

Input

The input is given from Standard Input in the following format:

$N$
$H_1$ $H_2$ $\ldots$ $H_N$

Output

Print the integer representing the highest bridge in AtCoder village.

Sample Input 1

3
50 80 70

Sample Output 1

2

The village has three bridges.
The first, second, and third bridges have heights of $50$, $80$, and $70$, respectively, so the second bridge is the highest.
Thus, $2$ should be printed.

Sample Input 2

1
1000000000

Sample Output 2

1

The village has only one bridge, so the first bridge is the highest.

Sample Input 3

10
22 75 26 45 72 81 47 29 97 2

Sample Output 3

9

The village has ten bridges, and the ninth bridge (with a height of $97$) is the highest.

问题描述

在AtCoder村有N座桥。第i座桥的高度为H_i（i为1到N之间的整数）。

打印表示村里最高桥的数字。

约束

• $1\leq N \leq 100$
• $1\leq H_i \leq 10^9$
• 所有的H_i都不同。
• 输入中的所有值都是整数。

输入

输入将以以下格式从标准输入给出：

$N$
$H_1$ $H_2$ $\ldots$ $H_N$

输出

打印表示AtCoder村里最高桥的整数。

样例输入1

3
50 80 70

样例输出1

2

村里有三座桥。
第一、第二、第三座桥的高度分别为50、80、70，所以第二座桥是最高的。
因此，应打印2。

样例输入2

1
1000000000

样例输出2

1

村里只有一座桥，所以第一座桥是最高的。

样例输入3

10
22 75 26 45 72 81 47 29 97 2

样例输出3

9

村里有十座桥，第九座桥（高度为97）是最高的。