Birthday Cake Candles

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;



public class Solution {
    public static void main(String[] args) {
        int n;
        Scanner sc=new Scanner(System.in);
        n=sc.nextInt();
        int[] arr=new int[n];
        for(int i=0;i<n;i++)
        {
            arr[i]=sc.nextInt();
        }
        int max=arr[0];
        for(int j=1;j<n;j++)
        {
            if(arr[j]>max)
            max=arr[j];
        }
        int c=0;
        for(int i=0;i<n;i++)
        {
            if(arr[i]==max)
            c++;
        }
        System.out.println(c);
    }
}