The inventory keeper Jeweler has been asked to optimize the storeroom layout. On the desk lies a long table of readings readings. Task: Read n integers and print how many of the elements after the first are strictly greater than the first element. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of elements a[2..n] greater than a[1]. Constraints: 1 <= n <= 808; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 808; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
