/* Programming Competition - Template (Horatiu Lazu) */

import java.io.*;
import java.util.*;
import java.lang.*;
import java.awt.*;
import java.awt.geom.*;
import java.math.*;
import java.text.*;


class Main{
	BufferedReader in;
	StringTokenizer st;
	
	public static void main (String [] args){
		new Main();
	}

	public Main(){
		try{
			in = new BufferedReader(new InputStreamReader(System.in));
			int N = nextInt();
			int [] arr = new int[N];
			for(int x = 0; x < N; x++)
				arr[x] = nextInt();
			int largestSoFar = 0;
			int ans = 0;
			for(int x = 0; x < N; x++){
				if (arr[x] > largestSoFar){
					largestSoFar = Math.max(arr[x], largestSoFar);
					ans = 0;
				}
				if (arr[x] == largestSoFar){
					ans++;	
				}
			}
			System.out.println(ans);
			
		}
		catch(IOException e){
			System.out.println("IO: General");
		}
	}
	
	String next() throws IOException {
		while (st == null || !st.hasMoreTokens())
	   	 	st = new StringTokenizer(in.readLine().trim());
		return st.nextToken();
	}

	long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	String nextLine() throws IOException {
		return in.readLine().trim();
	}
}