import java.util.Scanner;

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

        int ans = 0;
        for (int i = 1; i < N; i++) {
            int max = 0;
            for (int j = 0; j <= i; j++) {
                if (H[j] > max) {
                    max = H[j];
                }
            }
            if (max == H[i]) {
                ans++;
            }
        }
        System.out.println(ans+1);
    }
} import java.util.Scanner; Scanner 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];
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

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

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

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

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

        int ans = 0;
        for (int i = 1; i < N; i++) {
            int max = 0;
            for (int j = 0; j <= i; j++) {
                if (H[j] > max) {
                    max = H[j];
                }
            }
            if (max == H[i]) {
                ans++;
            }
        }
        System.out.println(ans+1);
    }
} Main
import java.util.Scanner;

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

        int ans = 0;
        for (int i = 1; i < N; i++) {
            int max = 0;
            for (int j = 0; j <= i; j++) {
                if (H[j] > max) {
                    max = H[j];
                }
            }
            if (max == H[i]) {
                ans++;
            }
        }
        System.out.println(ans+1);
    }
}
