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 top = 0;
        int topCount = 0;
        for(int height_i=0; height_i < n; height_i++){
            height[height_i] = in.nextInt();
            if(height[height_i] > top){
                top = height[height_i];
            }
        }
        for(int height_i = 0; height_i < n; ++height_i){
            if(height[height_i] == top){
                ++topCount;
            }
        }
        System.out.println(topCount);
    }
}