/*
 * Solution Template for Level Ground
 * 
 * Australian Informatics Olympiad 2022
 * 
 * This file is provided to assist with reading of input and writing of output 
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <stdio.h>

/* N is the number of segments. */
int N;

/* A contains the altitude of the segments. */
int A[100005];

int answer;

int main(void) {
    int i;

    /* Read the value of N. */
    scanf("%d", &N);

    /* Read the altitudes. */
    for (i = 0; i < N; i++) {
        scanf("%d", &A[i]);
    }

    /*
     * TODO: This is where you should compute your solution. Store the highest
     * intensity that can be achieved into the variable answer.
     */

    /* Write the answer. */
    printf("%d\n", answer);

    return 0;
}