//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")
#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)
using namespace std;
const int N = 1e6 + 7;
const int M = 1e5 + 7;
const int maxA = 1e5 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 998244353;
const ld eps = 1e-9;
pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//clock_t start = clock();
//#define int long long
int n, a[N], cnt[N];
int calc() {
for (int i = 1;i <= n;i++)cnt[a[i]] = 0;
for (int i = 1;i <= n;i++)cnt[a[i]]++;
int ans = 0;
for (int i = 1;i <= n;) {
int mxr = i;
for (int r = i;r <= n;r++) {
if (i < r && a[r - 1] < a[r])break;
for (int pos = i;pos <= r;pos++)cnt[a[pos]]--;
bool ok = 1;
for (int x = a[i] - 1;x > a[r];x--)ok &= (!cnt[x]);
for (int pos = i;pos <= r;pos++)cnt[a[pos]]++;
if (!ok)break;
mxr = max(mxr, r);
}
for (int pos = i;pos <= mxr;pos++)cnt[a[pos]]--;
i = mxr + 1, ans++;
}
return ans;
}
void solve() {
cin >> n;
for (int i = 1;i <= n;i++)cin >> a[i];
reverse(a + 1, a + n + 1);
cout << calc();
}
signed main() {
//srand(time(NULL));
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("subsequence.in", "r", stdin);
//freopen("subsequence.out", "w", stdout);
int test = 1;
//cin >> test;
for (int t = 1;t <= test;t++) {
//cout << "Case " << t << ": ";
solve();
}
return 0;
}
