/*
 * Solution Template for Making Bank
 * 
 * Australian Informatics Olympiad 2023
 * 
 * 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 <stdio.h>

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

/* days contains the type of each day. */
char days[100005];

int answer;
int main(void) {
    FILE *input_file;
    FILE *output_file;

    /* Open the input and output files. */
    input_file = fopen("bankin.txt", "r");
    output_file = fopen("bankout.txt", "w");

    /* Read the value of N and the string of characters from the input file. */
    fscanf(input_file, "%d", &N);
    fscanf(input_file, "%s", days);

    /*
     * TODO: This is where you should compute your solution. Store the most
     * money that you can retire with 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;
}