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();
        }
        
        Arrays.sort(height);
        int max = height[height.length-1];
        int counter = 0;
        
        for (int i = height.length-1; i >= 0; --i) {
            if (height[i] == max) {
                ++counter;
            } else {
                break;
            }
        }
        System.out.print(counter);
    }
}