Find Takahashi

AtCoder

IDabc275_a

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

3
50 80 70

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.

Input #2

1
1000000000

Output #2

1

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

Input #3

10
22 75 26 45 72 81 47 29 97 2

Output #3

9

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

API Response (JSON)

{
  "problem": {
    "name": "Find Takahashi",
    "description": {
      "content": "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. P",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc275_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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$).  \nEvery two different bridges in the village have different heights.\nP...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments