
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int N = scanner.nextInt();
		int[] montains = new int[N + 1];
		int westMost = 0;
		int ans = 0;
		for (int i = 1; i <= N; i++) {
			montains[i] = scanner.nextInt();
			if(montains[i] >= westMost) {
				westMost = montains[i];
				ans++;
			}
		}
		System.out.println(ans);
		scanner.close();
	}
}

/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