Under construction

Still being built. Things may change

Gahui and Sousenkyo 2

Interview

Time limit4sMemory limit512 MB

Summary
Given Gahui's character's vote count and the counts of the other characters, print that character's rank, where more votes means a higher rank.
Level

Easy2 of 10

Topics
Array, Implementation
Solved
No attempts yet

Problem

Gahui is watching the annual character election. After the election, the top 16 characters receive enormous benefits for one year. For that reason, fans vote passionately to get their favorite characters into the top 16. Remarkably, at least one Cinderella appears in every election, achieving an outstanding outcome.

Of course, the ranking is high if the number of votes is high. Gahui supports only one character. Find the ranking of the character she supports.

Input

The first line contains nn, the number of characters participating in the election.

The second line contains the number of votes for the character Gahui supports.

The third line contains n−1n-1 integers separated by spaces. These integers are the vote counts of the characters Gahui does not support.

Output

Print the ranking of the character Gahui supports.

Constraints

  • 2≤n≤20 0002 \le n \le 20\,000
  • All characters' vote counts are between 1 and 200000, inclusive.
  • Every character has a different number of votes.

Examples1

  1. Example 1

    Input
    10
    97026
    117421 84792 41751 98302 135059 32043 128569 76353 8647
    
    Expected output
    5