一本通1062

//qf
#include <bits/stdc++.h>
#define f(i,j,n) for(register int i=j;i<=n;i++)
using namespace std;
typedef long long ll;
inline ll read(){
    ll x=0;
    int f=1;
    char ch=getchar();
    while(!isdigit(ch)) {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(isdigit(ch)) x=(x<<1)+(x<<3)+ch-48,ch=getchar();
    return x*f;
}
inline ll Max(ll x,ll y){
    return x>y?x:y;
}
int n=read();
ll maxn=-0x7f7f7f7f;
signed main(){
    f(i,1,n) maxn=Max(maxn,read());
    cout<<maxn<<endl;
    return 0;
}