Counting problem (2)

Given a sequence of n integer numbers x₁…x_(n), count how many i’s, with
1 ≤ i ≤ n, follow the property

|{j : 1 ≤ j ≤ n ∧ x_(j) < x_(i)}| = i .

Input

The input consists of several cases. Each case begins with n, followed
by the n integer numbers x₁…x_(n). Assume 0 ≤ n ≤ 10⁵.

Output

For each case, print the number of indices i that fulfill the condition
above.

Problem information

Author: Salvador Roura

Generation: 2026-01-25T10:19:03.995Z

© Jutge.org, 2006–2026.
https://jutge.org
