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

#include <cstdio>

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

/*
 * D contains the distances. 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) {
    /* Open the input and output files. */
    FILE *input_file = fopen("javelin.txt", "r");
    FILE *output_file = fopen("javelout.txt", "w");

    /* Read the value of N and the distances from the input file. */
    fscanf(input_file, "%d", &N);
    for (int i = 0; i < N; i++) {
        fscanf(input_file, "%d", &D[i]);
    }

    /*
     * TODO: This is where you should compute your solution. Store the number
     * of current leaders that there were during the competition into the
     * variable answer.
     */

    /* Write the answer to the output file. */
    fprintf(output_file, "%d\n", answer);

    /* Finally, close the input/output files. */
    fclose(input_file);
    fclose(output_file);

    return 0;
}