import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int height[] = new int[n];
        int count =0;
        int max=0;
        for(int i=0; i < n; i++){
            int current = in.nextInt();
            boolean greater = current>max;
            boolean equal = current ==max;
            if(greater){
                count=1;
                max = current;
            }
            else if(equal)count++;
        }
        System.out.println(count);
    }
}