Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
You are given an array that contains each number between 1…n
exactly once. Your task is to collect the numbers from 1
to n
in increasing order.
On each round, you go through the array from left to right and collect as many numbers as possible. What will be the total number of rounds?
Input
The first line has an integer n
: the array size.
The next line has n
integers x1,x2,…,xn
: the numbers in the array.
Output
Print one integer: the number of rounds.
Constraints
Example
Input:
5
4 2 1 5 3
Output:
3
Äëÿ îòïðàâêè ðåøåíèé íåîáõîäèìî âûïîëíèòü âõîä.
|