#include<cstdio>
#include<cstdlib>
using namespace std;
int v[100005],n,a,b,mx,g;
struct nod
{
    int inf;
    nod*st,*dr;
}*p;
void rec(int a,int b,nod*&c)
{
    c=new nod;
    if(a==b)
    {
        c->inf=v[a];return;
    }
    int m=(a+b)>>1;
    rec(a,m,c->st);
    rec(m+1,b,c->dr);
    a=c->st->inf;b=c->dr->inf;
    c->inf=a>b?a:b;
}
void cautare(nod*c)
{
}
int main()
{
    int i,m,k;
    scanf("%d",&n);
    for(i=1;i<=n;++i);
        //scanf("%d",&v[i]);
    rec(1,n,p);
}