#include <stdio.h>
int find_max_element(int *ptr, int n) {
// Your logic here
int* current = ptr;
int* next = ptr + 1;
int* end = ptr + n - 1;
int max = *current;
while(current < end){
if(*current < *next){
max = *next;
}
current++;
next++;
}
return max;
}
int main() {
int n;
scanf("%d", &n);
int arr[100];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int result = find_max_element(arr, n);
printf("%d", result);
return 0;
}