/*
 * Solution Template for ORAC
 * 
 * Australian Informatics Olympiad 2025
 * 
 * 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 informatics problems on ORAC. */
int N;

/*
 * D contains the difficulty scores of the problems. Note that the array starts
 * from 0, and so the values are D[0] to D[N-1].
 */
int D[200005];

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

  /* Read the value of N and the difficulty scores. */
  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%d", &D[i]);
  }

  /*
   * TODO: This is where you should compute your solution. Store the minimum
   * number of mornings you must spend training to solve all N problems into
   * the variable answer.
   */

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

  return 0;
}