import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] H;
		H = new int[N];
		int sum = 1;
		for(int n = 0; n < N; n++) {
			H[n] = sc.nextInt();
			int max = H[0];
			for(int index = 0; index < H.length; index++) {
				max = Math.max(max, H[index]);
			}
			if(n != 0) {
				if(H[n] >= H[n - 1] && H[n] >= max) {
					sum ++;
				}
			}
		}
		sc.close();
		System.out.print(sum);
	}
}
/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