import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int[] mountains = new int[N];
        for (int i = 0; i < N; i++) {
            mountains[i] = sc.nextInt();
        }

        int answer = 0;

        int highest = 0;
        for (int i = 0; i < N; i++) {
            if (highest <= mountains[i]) {
                answer++;
                highest = mountains[i];
            }
        }

        System.out.println(answer);
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz