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];
        HashMap<Integer,Integer> map = new HashMap<>();
        
        int max = -1;
        
        for(int height_i=0; height_i < n; height_i++){
        
            height[height_i] = in.nextInt();
            if(map.containsKey(height[height_i]))
            {
                map.put(height[height_i],map.get(height[height_i])+1);    
            }
            else{
                map.put(height[height_i],1);
            }
            
            if(height[height_i]>max){
                max = height[height_i];
            }
            
        }
        
        System.out.println(map.get(max));
        
        
        
        
        
    }
}