import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;


public class  Main{
	public static void main(String[] args) throws Exception{
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    }
    static class edge implements Comparable<edge>{
    	int node;int cost;
    	edge(int a,int b){
    		node=a;cost=b;
    	}
		@Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		}
		public String toString() {
			return "("+node+" "+cost+")";
		}
    }
    static class MScanner {
		StringTokenizer st;
		BufferedReader br;
 
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
} import java.io.*; io.* java import java.math.BigInteger; BigInteger java.math import java.util.*; util.* java import java.util.Map.Entry; Entry java.util.Map public class  Main{
	public static void main(String[] args) throws Exception{
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    }
    static class edge implements Comparable<edge>{
    	int node;int cost;
    	edge(int a,int b){
    		node=a;cost=b;
    	}
		@Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		}
		public String toString() {
			return "("+node+" "+cost+")";
		}
    }
    static class MScanner {
		StringTokenizer st;
		BufferedReader br;
 
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
} Main public static void main(String[] args) throws Exception{
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    } main {
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    } MScanner sc = new MScanner(System.in); sc new MScanner(System.in) PrintWriter pw=new PrintWriter(System.out); pw new PrintWriter(System.out) int n=sc.nextInt(); n sc.nextInt() sc.nextInt sc int ans=1; ans 1 int cov=sc.nextInt(); cov sc.nextInt() sc.nextInt sc for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        } int i=1; int i=1; i 1 i<n i n i++ i++ i {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        } {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        } int x=sc.nextInt(); x sc.nextInt() sc.nextInt sc if(x>=cov) {
        		ans++;cov=x;
        	} x>=cov x cov {
        		ans++;cov=x;
        	} ans++ ans cov=x cov x pw.println(ans) pw.println pw ans pw.flush() pw.flush pw String[] args args static class edge implements Comparable<edge>{
    	int node;int cost;
    	edge(int a,int b){
    		node=a;cost=b;
    	}
		@Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		}
		public String toString() {
			return "("+node+" "+cost+")";
		}
    } edge int node; node int cost; cost edge(int a,int b){
    		node=a;cost=b;
    	} edge {
    		node=a;cost=b;
    	} node=a node a cost=b cost b int a a int b b @Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		} compareTo {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		} if(cost!=o.cost) {
				return cost-o.cost;
			} cost!=o.cost cost o.cost o o.cost {
				return cost-o.cost;
			} return cost-o.cost; cost-o.cost cost o.cost o o.cost return node-o.node; node-o.node node o.node o o.node edge o o public String toString() {
			return "("+node+" "+cost+")";
		} toString {
			return "("+node+" "+cost+")";
		} return "("+node+" "+cost+")"; "("+node+" "+cost+")" cost " " "("+node+" "+cost+")" "(" node " " cost ")" Comparable static class MScanner {
		StringTokenizer st;
		BufferedReader br;
 
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	} MScanner StringTokenizer st; st BufferedReader br; br public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		} MScanner {
			br = new BufferedReader(new InputStreamReader(system));
		} br = new BufferedReader(new InputStreamReader(system)) br new BufferedReader(new InputStreamReader(system)) InputStream system system public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		} MScanner {
			br = new BufferedReader(new FileReader(file));
		} br = new BufferedReader(new FileReader(file)) br new BufferedReader(new FileReader(file)) String file file public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		} next {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		} while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine()); st == null || !st.hasMoreTokens() st == null st null !st.hasMoreTokens() st.hasMoreTokens() st.hasMoreTokens st st = new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) return st.nextToken(); st.nextToken() st.nextToken st public String nextLine() throws IOException {
			return br.readLine();
		} nextLine {
			return br.readLine();
		} return br.readLine(); br.readLine() br.readLine br public int nextInt() throws IOException {
			return Integer.parseInt(next());
		} nextInt {
			return Integer.parseInt(next());
		} return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		} nextDouble {
			return Double.parseDouble(next());
		} return Double.parseDouble(next()); Double.parseDouble(next()) Double.parseDouble Double next() next public char nextChar() throws IOException {
			return next().charAt(0);
		} nextChar {
			return next().charAt(0);
		} return next().charAt(0); next().charAt(0) next().charAt next() next 0 public Long nextLong() throws IOException {
			return Long.parseLong(next());
		} nextLong {
			return Long.parseLong(next());
		} return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next public boolean ready() throws IOException {
			return br.ready();
		} ready {
			return br.ready();
		} return br.ready(); br.ready() br.ready br public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		} waitForInput {
			Thread.sleep(3000);
		} Thread.sleep(3000) Thread.sleep Thread 3000 public class  Main{
	public static void main(String[] args) throws Exception{
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    }
    static class edge implements Comparable<edge>{
    	int node;int cost;
    	edge(int a,int b){
    		node=a;cost=b;
    	}
		@Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		}
		public String toString() {
			return "("+node+" "+cost+")";
		}
    }
    static class MScanner {
		StringTokenizer st;
		BufferedReader br;
 
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
} public class  Main{
	public static void main(String[] args) throws Exception{
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    }
    static class edge implements Comparable<edge>{
    	int node;int cost;
    	edge(int a,int b){
    		node=a;cost=b;
    	}
		@Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		}
		public String toString() {
			return "("+node+" "+cost+")";
		}
    }
    static class MScanner {
		StringTokenizer st;
		BufferedReader br;
 
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
} Main
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;


public class  Main{
	public static void main(String[] args) throws Exception{
    	MScanner sc = new MScanner(System.in);
        //MScanner sc = new MScanner("reduce.in");
        PrintWriter pw=new PrintWriter(System.out);
        int n=sc.nextInt();
        int ans=1;int cov=sc.nextInt();
        for(int i=1;i<n;i++) {
        	int x=sc.nextInt();
        	if(x>=cov) {
        		ans++;cov=x;
        	}
        }
        pw.println(ans);
        pw.flush();
    }
    static class edge implements Comparable<edge>{
    	int node;int cost;
    	edge(int a,int b){
    		node=a;cost=b;
    	}
		@Override
		public int compareTo(edge o) {
			if(cost!=o.cost) {
				return cost-o.cost;
			}
				return node-o.node;
			
		}
		public String toString() {
			return "("+node+" "+cost+")";
		}
    }
    static class MScanner {
		StringTokenizer st;
		BufferedReader br;
 
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
}