import java.util.*;

public class Main {
  public static void main(String[] args ) throws Exception {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  }
}
 import java.util.*; util.* java public class Main {
  public static void main(String[] args ) throws Exception {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  }
} Main public static void main(String[] args ) throws Exception {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int count=0; count 0 boolean A=false; A false int Mountains[]=new int[N]; Mountains new int[N] N for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    } int i=0; int i=0; i 0 i<N i N i++ i++ i {
      Mountains[i]=sc.nextInt();
    } {
      Mountains[i]=sc.nextInt();
    } Mountains[i]=sc.nextInt() Mountains[i] Mountains i sc.nextInt() sc.nextInt sc for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      } int i=1; int i=1; i 1 i<N i N i++ i++ i {
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      } {
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      } A=false A false for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      } int j=0; int j=0; j 0 j<i j i j++ j++ j {
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      } {
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      } if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        } Mountains[i]<Mountains[j] Mountains[i] Mountains i Mountains[j] Mountains j {
          A=true;
          break;
        } A=true A true break; if(A==false){
        count++;
      } A==false A false {
        count++;
      } count++ count System.out.println(count+1) System.out.println System.out System System.out count+1 count 1 String[] args args public class Main {
  public static void main(String[] args ) throws Exception {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  }
} public class Main {
  public static void main(String[] args ) throws Exception {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  }
} Main
import java.util.*;

public class Main {
  public static void main(String[] args ) throws Exception {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int count=0;
    boolean A=false;
    int Mountains[]=new int[N];
    for(int i=0;i<N;i++){
      Mountains[i]=sc.nextInt();
    }
    for(int i=1;i<N;i++){
      A=false;
      for(int j=0;j<i;j++){
        if(Mountains[i]<Mountains[j]){
          A=true;
          break;
        }
      }if(A==false){
        count++;
      }
      }
    System.out.println(count+1);
  }
}

