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();
        TreeMap<Integer, Integer> treeMap = new TreeMap<>();
        for(int i=0; i < n; i++){
            int val = in.nextInt();
            if (treeMap.containsKey(val)) {
                treeMap.put(val, treeMap.get(val) + 1);
            } else {
                treeMap.put(val, 1);
            }
        }
        
        
        Iterator it = treeMap.keySet().iterator();
        int count = 0;
        while(it.hasNext()) {
            count = treeMap.get(it.next());
        }
        
        System.out.print(count);
    }
}