import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] mount = new int[N];
        
        for(int i = 0 ; i < N ; i++){
            mount[i] = sc.nextInt();
        }
        
        int cnt = 1;
        int max = 0;
        
        for(int m = 1 ; m < N ; m++){
            if((mount[0] <= mount[m]) && max <= mount[m]){
                cnt += 1;
                if(max < mount[m]) {
                	max = mount[m];
                }
            }
        }
        System.out.println(cnt);
    }
}
/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