import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    }
} Main public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    } main {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    } final Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] H = new int[N]; H new int[N] N int highest = 0; highest 0 int count = 0; count 0 for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        } {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        } H[i] = Integer.parseInt(sc.next()) H[i] H i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            } i == 0 i 0 {
                highest = H[i];
                count++;
            } highest = H[i] highest H[i] H i count++ count {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            } if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                } H[i] >= highest H[i] H i highest {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } count++ count if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    } H[i] > highest H[i] H i highest {
                        highest = H[i];
                    } highest = H[i] highest H[i] H i {

                    } {

                } System.out.print(count) System.out.print System.out System System.out count String[] args args public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    }
} public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    }
} Main
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] H = new int[N];
        int highest = 0;
        int count = 0;

        for (int i = 0; i < N; i++) {
            H[i] = Integer.parseInt(sc.next());
            if (i == 0) {
                highest = H[i];
                count++;
            } else {
                if (H[i] >= highest) {
                    count++;
                    if (H[i] > highest) {
                        highest = H[i];
                    } else {

                    }
                } else {

                }
            }
        }
        System.out.print(count);
    }
}