#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>

//using namespace std;

using ll = long long;

using ull = unsigned long long;

#define int long long

int T;

int n;

const int MAXN = 1e5 + 10;

int a[MAXN];

int cnt;

int b[MAXN];

void solve(){
	
	std :: cin >> n;
	
	for(int i = 1;i <= n;i++)
		std :: cin >> a[i];
	
	
	for(int i = 2;i <= n;i++){
		
		if(a[i] < a[i - 1])
			cnt++;
		
	}
	
	std :: cout << cnt + 1<< '\n';
	
}

signed main(){
	
	std :: ios::sync_with_stdio(false);
	
	std :: cin.tie(0);
	
	std :: cout.tie(0);
	
	T = 1;
	
	while(T--)
		solve();
	
	return (0 - 0);
}