from bisect import bisect_left as bl,bisect_right as br
n=int(input())
a=list(map(int,input().split()))
a=[[x,i] for i,x in enumerate(a)]
a.sort(key=lambda x:x[0])
ans=0
ary=[0]*n
for x,i in a:
  if i==n-1:
    ans+=1
    ary[i]=1
  else:
    if ary[i+1]==0:
      ans+=1
      ary[i]=1
print(ans)