#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<ii> vii;
typedef set<int> si;
typedef map<int,int> mii;
const int INF = 2e5 + 100;
int n;
vi h;
set<int> st;
int32_t main(){
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++){
cin >> h[i];
}
int cnt = 0;
for (int i = 0; i < n; i++){
auto itr = st.lower_bound(h[i]+1);
if (itr == st.end() || *itr != h[i] + 1) cnt++;
st.insert(h[i]);
}
cout << cnt;
return 0;
}
