#include <bits/stdc++.h>
using namespace std;
#define int long long
const int H = 150;
struct sub_hash {
vector<vector<int>> dp, inv;
array<int,H> mod;
array<int,H> base;
long long pw(long long a,long long b,int m){
long long r=1;
while(b){
if(b&1) r=r*a%m;
a=a*a%m;
b>>=1;
}
return r;
}
array<int,H> query(int l,int r){
array<int,H> res;
for(int k=0;k<H;k++){
long long val = (dp[k][r+1]-dp[k][l]+mod[k])%mod[k];
val = val*inv[k][l]%mod[k];
res[k] = val;
}
return res;
}
void init(const vector<int>& vec){
int n = vec.size();
dp.assign(H, vector<int>(n+5));
inv.assign(H, vector<int>(n+5));
// generate primes for bases
int primes[] = {
31,37,41,43,47,53,59,61,67,71,
73,79,83,89,97,101,103,107,109,113,
127,131,137,139,149,151,157,163,167,173,
179,181,191,193,197,199,211,223,227,229,
233,239,241,251,257,263,269,271,277,281
};
for(int i=0;i<H;i++){
base[i] = primes[i % 50];
mod[i] = 1000000007 + i * 97; // generate large mods
}
for(int k=0;k<H;k++){
long long p = base[k];
long long pwv = 1;
for(int i=0;i<n;i++){
dp[k][i+1]=(dp[k][i]+(vec[i]-'0'+1)*pwv)%mod[k];
pwv=pwv*p%mod[k];
}
inv[k][n-1]=pw(pw(p,n-1,mod[k]),mod[k]-2,mod[k]);
for(int i=n-2;i>=0;i--)
inv[k][i]=1LL*inv[k][i+1]*p%mod[k];
}
}
} hsh_on, hsh_srt;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, ans = 0;
cin >> n;
vector<int> a(n, 0), srt(n, 0);
for(int i = 0; i < n; ++i){
cin >> a[i];
srt[i] = a[i];
}
sort(srt.begin(), srt.end());
int remov = 0;
while(remov != n){
hsh_on.init(a);
hsh_srt.init(srt);
map<array<int,H>, pair<int, int>> mp;
for(int i = 0; i < (int) srt.size(); ++i){
for(int j = i; j < (int) srt.size(); ++j){
mp[hsh_srt.query(i, j)] = {i, j};
}
}
int i = (int) a.size() - 1, j = (int) a.size() - 1;
int st = 0, en = (int) a.size() - 1;
pair<int, int> rem;
while(st <= en){
int mid = st + (en - st) / 2;
array<int,H> qry = hsh_on.query(mid, (int) a.size() - 1);
if(mp.count(qry)){
j = mid;
en = mid - 1;
rem = mp[qry];
}else{
st = mid + 1;
}
}
vector<int> new_arr;
for(int i = 0; i < rem.first; ++i){
new_arr.push_back(srt[i]);
}
for(int i = rem.second + 1; i < (int) a.size(); ++i){
new_arr.push_back(srt[i]);
}
ans += 1, remov += rem.second - rem.first + 1;
int k = rem.second - rem.first + 1;
while(k--){
a.pop_back();
}
swap(new_arr, srt);
}
cout << ans << "\n";
return 0;
}
