#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
struct count{
    int szam;
    int sorszam;
};
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
vector<int>v;
vector<int>max;
int beff[100001];
int place[100001];
int maxmplace;
int maxmindex;
int main()
{
    int n;
    f>>n;
    for (int i=0; i<n; i++)
    {
        int a;
        f>>a;
        v.push_back(a);
    }
    f.close();
    for (int i=0; i<n; i++)
    {
        int maxm=0;
        fill(v.begin()+i,v.end(),i);
    }
    /*for (int i=0;i<n;i++){
        cout<<beff[i]<<" ";
    }
    cout<<endl;
    for (int i=0;i<n;i++){
        cout<<place[i]<<" ";
    }
    cout<<endl;*/
    g<<++maxmplace;
    g<<endl;
    g.close();
    return 0;
}