#include<algorithm>
using namespace std;
int n;
void solve(){
    int i,next,prev=0;
    long long unsigned k=0;
    scanf("%d",&n);
    for(i=1; i<=n; ++i){
        scanf("%d",&next);
        if(next>prev)
            k+=next-prev;
        prev=next;}
    printf("%lld",k);}
int main(){
    freopen("operatii.in","r",stdin);
    freopen("operatii.out","w",stdout);
    solve();
    return 0;}