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];
        for(int height_i=0; height_i < n; height_i++){
            height[height_i] = in.nextInt();
        }
        
        Hashtable ht = new Hashtable();
        int maxHeight = 0;
        
        for (int i : height) {
            if (i > maxHeight)
                maxHeight = i;
            
            if (ht.containsKey(i))
                {
                ht.put(i, ((Integer)ht.get(i)) + 1);
                
            } else {
                ht.put(i, 1);
            }
        }
      
        if (!ht.isEmpty())
            {
            System.out.print(((Integer)ht.get(maxHeight)) );
        } else
            {
            System.out.print(0);
        }
    }
}