#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ordered_set st;
int n;
cin>>n;
pair<int,int>pr[n];
for(int i=0;i<n;i++){cin>>pr[i].first;pr[i].second=i;}
sort(pr,pr+n);
vector<int>v;
for(auto &i:pr)v.push_back(i.second);
int ans=0;
for(int i=1;i<n;i++){
if(v[i]!=v[i-1])ans++;
}
cout<<ans/2+1;
}
