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
 */
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);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
}
 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);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
} 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);
        B solver = new B();
        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);
        B solver = new B();
        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) B solver = new B(); solver new B() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        }

    } B public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        } solve {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        } int n = Integer.parseInt(in.next()); n Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int h[] = new int[n]; h new int[n] n for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                h[i] = Integer.parseInt(in.next());
            } {
                h[i] = Integer.parseInt(in.next());
            } h[i] = Integer.parseInt(in.next()) h[i] h i Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int ans = 1; ans 1 for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            } int i = 1; int i = 1; i 1 i < n i n i++ i++ i {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            } {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            } int cnt = 0; cnt 0 for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                } int j = 0; int j = 0; j 0 j <= i - 1 j i - 1 i 1 j++ j++ j {
                    if (h[i] >= h[j]) ++cnt;
                } {
                    if (h[i] >= h[j]) ++cnt;
                } if (h[i] >= h[j]) ++cnt; h[i] >= h[j] h[i] h i h[j] h j ++cnt cnt if (cnt >= i) ans++; cnt >= i cnt i ans++ ans out.println(ans) out.println out ans 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);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
} 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);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
} 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
 */
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);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int h[] = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(in.next());
            }
            // 最初の旅館は必ず見えるので1
            int ans = 1;

            for (int i = 1; i < n; i++) {
                int cnt = 0;
                for (int j = 0; j <= i - 1; j++) {
                    if (h[i] >= h[j]) ++cnt;
                }
                if (cnt >= i) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
}

