Problem:
Score : 300 points

Problem Statement

Given is a permutation P_1, \ldots, P_N of 1, \ldots, N.
Find the number of integers i (1 \leq i \leq N) that satisfy the following condition:

For any integer j (1 \leq j \leq i), P_i \leq P_j.

Constraints

1 \leq N \leq 2 \times 10^5

P_1, \ldots, P_N is a permutation of 1, \ldots, N.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
P_1 ... P_N

Output

Print the number of integers i that satisfy the condition.

Sample Input 1

5
4 2 5 1 3

Sample Output 1

3

i=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.

Similarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.

Sample Input 2

4
4 3 2 1

Sample Output 2

4

All integers i (1 \leq i \leq N) satisfy the condition.

Sample Input 3

6
1 2 3 4 5 6

Sample Output 3

1

Only i=1 satisfies the condition.

Sample Input 4

8
5 7 4 2 6 8 1 3

Sample Output 4

4

Sample Input 5

1
1

Sample Output 5

1

Solution in Ruby (2.3.3) (judge verdict: Accepted)

# coding: cp932
N = gets.to_i
P = gets.split.map {|e| e.to_i}

# １つめの要素から検索していって、最大値を記録
# 最大値より小さい場合は○、
# 最大値より大きい場合は最大値を更新

_max = 0
_min = 0
ans = 0

P.each_with_index do |p, i|
  # p "p=#{p} ans=#{ans} max:#{_max} min=#{_min}"
  if i == 0
    ans += 1
    _max = p
    next
  end

  if i == 1
    if _max < p
      _min = _max
      _max = p
    else
      _min = p
      ans += 1
    end
    next
  end

  if p <= _min and p <= _max
    ans += 1
  else
    _max = p if p > _max
  end
  _min = p if p < _min
  
end

puts ans