import java.util.*;
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  }
  
  private static boolean canSee(int[] H, int i) {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  }
} import java.util.*; util.* java public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  }
  
  private static boolean canSee(int[] H, int i) {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  } 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 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 ans = 1; ans 1 for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    } int i = 2; int i = 2; i 2 i <= N i N i++ i++ i {
      if (canSee(H, i)) {
        ans++;
      }
    } {
      if (canSee(H, i)) {
        ans++;
      }
    } if (canSee(H, i)) {
        ans++;
      } canSee(H, i) canSee H i {
        ans++;
      } ans++ ans System.out.println(ans) System.out.println System.out System System.out ans String[] args args private static boolean canSee(int[] H, int i) {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  } canSee {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  } for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    } int j = 1; int j = 1; j 1 j <= i-1 j i-1 i 1 j++ j++ j {
      if (H[i] < H[j]) {
        return false;
      }
    } {
      if (H[i] < H[j]) {
        return false;
      }
    } if (H[i] < H[j]) {
        return false;
      } H[i] < H[j] H[i] H i H[j] H j {
        return false;
      } return false; false return true; true int[] H H int i i public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  }
  
  private static boolean canSee(int[] H, int i) {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  }
} public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  }
  
  private static boolean canSee(int[] H, int i) {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  }
} Main
import java.util.*;
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] H = new int[N+1];
    for (int i = 1; i <= N; i++) {
      H[i] = sc.nextInt();
    }
    
    int ans = 1;
    for (int i = 2; i <= N; i++) {
      if (canSee(H, i)) {
        ans++;
      }
    }
    
    System.out.println(ans);
  }
  
  private static boolean canSee(int[] H, int i) {

    for (int j = 1; j <= i-1; j++) {
      if (H[i] < H[j]) {
        return false;
      }
    }
    
    return true;
  }
}