#include<iostream>
using namespace std;
const int N=5e5+30;
int a[N];
int DnC(int l,int r){
    if(l==r) return a[l];
    int mid=(l+r)/2;
    return max(DnC(l,mid),DnC(mid+1,r));
}
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
    	cin>>a[i];
    }
    cout<<DnC(0,n-1)<<"\n";
} 

#include<iostream>
using namespace std;
const int N=1e5+30;
int a[N],b[N];
void merge_sort(int l,int r){
    if(l==r) return;
    int mid=l+(r-l)/2;
    merge_sort(l,mid);
    merge_sort(mid+1,r);
    for(int i=l;i<=r;i++) b[i]=a[i];
    int x=l,y=mid+1,cur=l;
    while(x<=mid&&y<=r){
    	if(b[x]<=b[y]){
            a[cur]=b[x];
            x++;
        }else{
            a[cur]=b[y];
            y++;
        }
        cur++;
    }
    while(x<=mid){
    	a[cur]=b[x];
        cur++,x++;
    }
    while(y<=r){
    	a[cur]=b[y];
        cur++,y++;
    }
    return;
}
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    merge_sort(0,n-1);
    for(int i=0;i<n;i++) cout<<a[i]<<" ";
    cout<<"\n";
}

#include<algorithm>
merge(a,a+n,b,b+m,c)

5
1 2 3 4 5
5
1 2 3 5 4
0

Case #1: 0

Case #2: 1

#include<iostream>
#define int long long
using namespace std;
const int N=1e5+30;
int a[N],b[N];
int reversed(int l,int r){
    if(l==r) return 0;
    int mid=l+(r-l)/2,ans=0;
    ans+=reversed(l,mid);
    ans+=reversed(mid+1,r);
    for(int i=l;i<=r;i++) b[i]=a[i];
    int x=l,y=mid+1,cur=l;
    while(x<=mid&&y<=r){
    	if(b[x]<=b[y]) a[cur++]=b[x++];
        else a[cur++]=b[y++],ans+=(mid-x+1);
    }
    while(x<=mid) a[cur++]=b[x++];
    while(y<=r) a[cur++]=b[y++];
    return ans;
}
signed main(){
	int n,t=0;
    while(cin>>n&&n){
    	for(int i=0;i<n;i++) cin>>a[i];
    	cout<<"Case #"<<++t<<": "<<reversed(0,n-1)<<"\n";
    }
}

#include<iostream>
#include<algorithm>
#include<vector>
#define int long long
using namespace std;
const int N=2e5+30;
typedef pair<int,int> p;
p P[N];
bool cmp(int a,int b){
    return P[a].second<P[b].second;
}
long long DQ(int l,int r){
    if(l==r) return 8e18;
    int mid=l+(r-l)/2,cur=min(DQ(l,mid),DQ(mid+1,r));
    vector<int> V;
    for(int i=l;i<=r;i++) if(abs(P[i].first-P[mid].first)*abs(P[i].first-P[mid].first)<cur) V.push_back(i);
    sort(V.begin(),V.end(),cmp);
    for(int i=0;i<V.size();i++){
        for(int j=max(0LL,i-10);j<i;j++){
            int x=(P[V[i]].first-P[V[j]].first),y=(P[V[i]].second-P[V[j]].second);
            if(cur>x*x+y*y) cur=x*x+y*y;
        }
    }
    return cur;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>P[i].first>>P[i].second;
    sort(P,P+n);
    cout<<DQ(0,n-1)<<"\n";
}

#include<iostream>
#include<algorithm>
#include<vector>
#define int long long
using namespace std;
const int N=2e5+30;
typedef pair<int,int> p;
p P[N];
bool cmp(p a,p b){
    return a.second<b.second;
}
long long DQ(int l,int r){
    if(l==r) return 8e18;
    int mid=l+(r-l)/2,midx=P[mid].first,cur=min(DQ(l,mid),DQ(mid+1,r));
    vector<p> W(r-l+5);
    merge(P+l,P+mid+1,P+mid+1,P+r+1,W.begin(),cmp);
    for(int i=l;i<=r;i++) P[i]=W[i-l];
    vector<int> V;
    for(int i=l;i<=r;i++) if(abs(P[i].first-midx)*abs(P[i].first-midx)<cur) V.push_back(i);
    for(int i=0;i<V.size();i++){
        for(int j=max(0LL,i-10);j<i;j++){
            int x=(P[V[i]].first-P[V[j]].first),y=(P[V[i]].second-P[V[j]].second);
            cur=min(cur,x*x+y*y); 
        }
    }
    return cur;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>P[i].first>>P[i].second;
    sort(P,P+n);
    cout<<DQ(0,n-1)<<"\n";
}

#include<iostream>
using namespace std;
int main(){
	int a,k,ans=1;
	cin>>n>>k;
	for(int i=0;i<k;i++) n*=a;
	cout<<ans<<"\n";
}

#include<iostream>
using namespace std;
int way1(int a,int k){
    if(k==0) return 1;
    if(k%2) return a*way1(a,k-1);
    int SQRT=way1(a,k/2);
    return SQRT*SQRT;
}
int way2(int a,int k){
    int ans=1,cur=a;
    while(k){
        if(k%2==1) ans*=cur;
        cur*=cur;
        k/=2;
    }
    return ans;
}
int main(){
    int a,k;
    cin>>a>>k;
    cout<<way1(a,k)<<" "<<way2(a,k)<<"\n";
}

#include<iostream>
#define int long long
using namespace std;
const int M=1e9+7;
int dnc(int a,int k){
    if(k==0) return 1;
    if(k%2) return (a*dnc(a,k-1)%M);
    int SQRT=dnc(a,k/2);
    return (SQRT*SQRT)%M;
}
signed main(){
    int t,a,k;
    cin>>t;
    while(t--){
    	cin>>a>>k;
 		cout<<dnc(a,k)<<"\n";
	}
}

#include<iostream>
using namespace std;
long long squ[2][2],cur[2][2]={{1,0},{0,1}};
long long MOD(long long x){
    long long M=1e9+7;
    return (x%M+M)%M;
}
void POW(int x){
    long long NEW[2][2],now=x;
    while(now){
        if(now%2){
            NEW[0][0]=MOD(MOD(cur[0][0]*squ[0][0])+MOD(cur[0][1]*squ[1][0]));
            NEW[0][1]=MOD(MOD(cur[0][0]*squ[0][1])+MOD(cur[0][1]*squ[1][1]));
            NEW[1][0]=MOD(MOD(cur[1][0]*squ[0][0])+MOD(cur[1][1]*squ[1][0]));
            NEW[1][1]=MOD(MOD(cur[1][0]*squ[0][1])+MOD(cur[1][1]*squ[1][1]));
            cur[0][0]=NEW[0][0],cur[0][1]=NEW[0][1],cur[1][0]=NEW[1][0],cur[1][1]=NEW[1][1];
        }
        NEW[0][0]=MOD(MOD(squ[0][0]*squ[0][0])+MOD(squ[0][1]*squ[1][0]));
        NEW[0][1]=MOD(MOD(squ[0][0]*squ[0][1])+MOD(squ[0][1]*squ[1][1]));
        NEW[1][0]=MOD(MOD(squ[1][0]*squ[0][0])+MOD(squ[1][1]*squ[1][0]));
        NEW[1][1]=MOD(MOD(squ[1][0]*squ[0][1])+MOD(squ[1][1]*squ[1][1]));
        squ[0][0]=NEW[0][0],squ[0][1]=NEW[0][1],squ[1][0]=NEW[1][0],squ[1][1]=NEW[1][1];
        now/=2;
    }
}
int main(){
    long long x1,x2,a,b,n;
    cin>>x1>>x2>>a>>b>>n;
    squ[0][0]=b,squ[0][1]=a,squ[1][0]=1,squ[1][1]=0;
    if(n==1) cout<<x1<<"\n";
    else if(n==2) cout<<x2<<"\n";
    else{
        POW(n-2);
        cout<<MOD(MOD(cur[0][0]*x2)+MOD(cur[0][1]*x1))<<"\n";
    } 
}