import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N+1];
        int count = 1;
        
        
        for(int i = 1; i <= N; i++) {
           H[i] = sc.nextInt();
        }

        int max = H[1];
        for(int i = 2; i <= N; i++) {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        }
        System.out.println(count);
    }
}  import java.util.Scanner; Scanner java.util class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N+1];
        int count = 1;
        
        
        for(int i = 1; i <= N; i++) {
           H[i] = sc.nextInt();
        }

        int max = H[1];
        for(int i = 2; i <= N; i++) {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        }
        System.out.println(count);
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N+1];
        int count = 1;
        
        
        for(int i = 1; i <= N; i++) {
           H[i] = sc.nextInt();
        }

        int max = H[1];
        for(int i = 2; i <= N; i++) {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        }
        System.out.println(count);
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N+1];
        int count = 1;
        
        
        for(int i = 1; i <= N; i++) {
           H[i] = sc.nextInt();
        }

        int max = H[1];
        for(int i = 2; i <= N; i++) {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        }
        System.out.println(count);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] H = new int[N+1]; H new int[N+1] N+1 N 1 int count = 1; count 1 for(int i = 1; i <= N; i++) {
           H[i] = sc.nextInt();
        } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
           H[i] = sc.nextInt();
        } {
           H[i] = sc.nextInt();
        } H[i] = sc.nextInt() H[i] H i sc.nextInt() sc.nextInt sc int max = H[1]; max H[1] H 1 for(int i = 2; i <= N; i++) {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        } int i = 2; int i = 2; i 2 i <= N i N i++ i++ i {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        } {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        } if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            } H[i] >= max H[i] H i max {
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            } max = H[i] max H[i] H i if(  H[i-1] <= H[i]) {
                    count++;
              } H[i-1] <= H[i] H[i-1] H i-1 i 1 H[i] H i {
                    count++;
              } count++ count System.out.println(count) System.out.println System.out System System.out count String[] args args
import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N+1];
        int count = 1;
        
        
        for(int i = 1; i <= N; i++) {
           H[i] = sc.nextInt();
        }

        int max = H[1];
        for(int i = 2; i <= N; i++) {
            if (H[i] >= max){
                max = H[i];
                if(  H[i-1] <= H[i]) {
                    count++;
              }
            }
        }
        System.out.println(count);
    }
} 