/*
 * Solution Template for Sunday Drive II
 * 
 * Australian Informatics Olympiad 2026
 * 
 * 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 length of the street. */
int N;
/* V contains the volume limits. The array starts from 0. */
int V[200005];

long long answer;
int main(void) {
  int i;

  /* Read the street length and volume limits. */
  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%d", &V[i]);
  }

  /*
   * Please note that the answer may exceed the maximum value
   * that can be stored in an "int" integer type.
   * Because of this, you should use the "long long" integer type
   * instead of "int" when computing your solution.
   */
  /* TODO: Compute the maximum enjoyment and store it in answer. */

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

  return 0;
}