import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Eric
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    }

    static class BGreatOceanView {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    }

    static class BGreatOceanView {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) BGreatOceanView solver = new BGreatOceanView(); solver new BGreatOceanView() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class BGreatOceanView {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        }

    } BGreatOceanView public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        } solve {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        } int N = in.nextInt(); N in.nextInt() in.nextInt in int H[] = new int[N]; H new int[N] N for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                H[i] = in.nextInt();
            } {
                H[i] = in.nextInt();
            } H[i] = in.nextInt() H[i] H i in.nextInt() in.nextInt in int nb = 1; nb 1 int start = H[0]; start H[0] H 0 for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            } int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            } {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            } if (H[i] >= start) {
                    start = H[i];
                    nb++;
                } H[i] >= start H[i] H i start {
                    start = H[i];
                    nb++;
                } start = H[i] start H[i] H i nb++ nb out.println(nb) out.println out nb int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    }

    static class BGreatOceanView {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    }

    static class BGreatOceanView {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Eric
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BGreatOceanView solver = new BGreatOceanView();
        solver.solve(1, in, out);
        out.close();
    }

    static class BGreatOceanView {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int H[] = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }
            int nb = 1;
            int start = H[0];
            for (int i = 1; i < N; i++) {
                if (H[i] >= start) {
                    start = H[i];
                    nb++;
                }
            }
            out.println(nb);
        }

    }
}

