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