#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,int>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
void solve(){
int n;
cin >> n;
int arr[n];
multiset<int>se;
for(int x=0;x<n;x++){
cin >> arr[x];
se.insert(arr[x]);
}
int counter=0;
for(int x=n-2;x>=0;x--){
if(arr[x]==arr[x+1]){
se.erase(se.find(arr[x]));
se.erase(se.find(arr[x]));
counter++;
}
else{
auto it=se.lower_bound(arr[x+1]);
if(it!=se.begin()&&*prev(it)==arr[x]){
counter++;
se.erase(se.find(arr[x]));
se.erase(se.find(arr[x+1]));
}
}
}
cout << n-counter;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("in.txt","r",stdin);
//freopen("in.txt","w",stdout);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
