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[] arr = new int[n];
        for (int arr_i = 0; arr_i < n; arr_i++) {
            arr[arr_i] = in.nextInt();
        }
        Arrays.sort(arr);
        int highest = arr[n-1];
        int count = 1;
        for (int i = n - 2; i >= 0; i-- ) {
            if (arr[i] == highest) {
                count++;
            } else {
                break;
            }
        }
        System.out.println(count);
    }
}