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);
        long num = in.nextLong();
        long value;
        Map<Long,Long> map = new TreeMap<Long,Long>();
        for(int i=0;i<num;i++){
        	value=in.nextLong();
        	if(map.containsKey(value)){
        		map.put(value,map.get(value)+1);
        	}
        	else{
        		map.put(value,(long) 1);
        	}
        }
        
            Set<Long> keys = map.keySet();
            Iterator<Long> i =keys.iterator();
            long key=0;
            while(i.hasNext()){
            	key=i.next();
            }
            System.out.println(map.get(key));
        	
        }

}