题解 | #小欧的数组修改#

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main {
    static void solve() {
        TreeMap<Integer,Integer> map = new TreeMap<>();
        int n = in.nextInt();
        for(int i=0;i<n;i++) {
            int x = in.nextInt();
            map.put(x,map.getOrDefault(x,0)+1);
        }
        int mx=0;
        for(int x:map.keySet()) {
            mx = Math.max(mx,map.get(x));
        }
        out.println(map.size()==1?n:mx+1);
    }

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    static FastReader in = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        static BufferedReader br;
        static StringTokenizer st;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            String str = "";
            while(st==null||!st.hasMoreElements()) {
                try {
                    str = br.readLine();
                } catch(IOException e) {
                    throw new RuntimeException(e);
                }
                st = new StringTokenizer(str);
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}