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.

Examples

Input

5
4 2 5 1 3


Output

3


Input

4
4 3 2 1


Output

4


Input

6
1 2 3 4 5 6


Output

1


Input

8
5 7 4 2 6 8 1 3


Output

4


Input

1
1


Output

1
N = int(raw_input())
array = map(int, raw_input().split())

num = 0
min_num = array[0]

for i in range(0,N):
    if min_num >= array[i]:
        num += 1
        min_num = array[i]

print num

# num = 0
# flag = 0

# for i in range(N):
#     flag = 1
#     for j in range(i):
#         print i,j
#         if array[i] <= array[j]:
#             print "match"
#             continue
#         else:
#             print "break",array[i] , array[j]
#             flag = 0
#             break
#     if flag == 1:
#         print ":",i
#         num += 1

# print num

# num = N

# for i in range(1,N):
#        if array[i-1] < array[i]:
#            num -= 1

# print num
