Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.

Mishka can put a box i into another box j if the following conditions are met:

  * i-th box is not put into another box; 
  * j-th box doesn't contain any other boxes; 
  * box i is smaller than box j (ai < aj). 



Mishka can put boxes into each other an arbitrary number of times. He wants to minimize the number of visible boxes. A box is called visible iff it is not put into some another box.

Help Mishka to determine the minimum possible number of visible boxes!

Input

The first line contains one integer n (1 ≤ n ≤ 5000) — the number of boxes Mishka has got.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the side length of i-th box.

Output

Print the minimum possible number of visible boxes.

Examples

Input

3
1 2 3


Output

1


Input

4
4 2 4 3


Output

2

Note

In the first example it is possible to put box 1 into box 2, and 2 into 3.

In the second example Mishka can put box 2 into box 3, and box 4 into box 1.
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Random;
import java.util.TreeSet;
import java.util.StringTokenizer;

import static java.lang.Math.abs;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.util.Arrays.copyOf;
import static java.util.Arrays.fill;
import static java.util.Arrays.sort;
import static java.util.Collections.reverseOrder;
import static java.util.Collections.sort;

public class Main {
    private FastScanner in;
    private PrintWriter out;

    private void solve() throws IOException {
        solveC();
    }

    private void solveA() throws IOException {
        for (int n = in.nextInt(), x, f; n-- > 0; ) {
            x = in.nextInt();
            f = 0;
            for (int i = 0; i * 3 <= x; i++) {
                if ((x - i * 3) % 7 == 0) {
                    f = 1;
                    break;
                }
            }
            out.println(f == 0 ? "NO" : "YES");
        }
    }

    private void solveB() throws IOException {
        String h = "HEAL", s = "STRIKE";
        long h1 = in.nextLong(), a1 = in.nextLong(), c1 = in.nextLong();
        long h2 = in.nextLong(), a2 = in.nextLong();
        StringBuilder sb = new StringBuilder();
        long cnt = 0;
        while (h2 > 0) {
            if (h1 > a2 || h2 <= a1) {
                h2 -= a1;
                sb.append('\n').append(s);
            } else {
                h1 += c1;
                sb.append('\n').append(h);
            }
            if (h2 > 0) {
                h1 -= a2;
            }
            cnt++;
        }
        out.print(cnt + sb.toString());
    }

    private void solveC() throws IOException {
        int n = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }
        shuffle(a);
        sort(a);
        int ans = 0;
        for (int i = 0, j, k; i < n; i = j) {
            for (j = i; j < n && a[i] == a[j]; j++) ;
            k = j - i;
            ans = k + max(0, ans - k);
        }
        out.println(ans);
    }

    private void solveD() throws IOException {

    }

    private void solveE() throws IOException {

    }

    private void shuffle(int[] a) {
        int b;
        Random r = new Random();
        for (int i = a.length - 1, j; i > 0; i--) {
            j = r.nextInt(i + 1);
            b = a[j];
            a[j] = a[i];
            a[i] = b;
        }
    }

    class FastScanner {
        StringTokenizer st;
        BufferedReader br;

        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        boolean hasNext() throws IOException {
            return br.ready() || (st != null && st.hasMoreTokens());
        }

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

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

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

        String nextLine() throws IOException {
            return br.readLine();
        }

        boolean hasNextLine() throws IOException {
            return br.ready();
        }
    }

    private void run() throws IOException {
        in = new FastScanner(System.in); // new FastScanner(new FileInputStream(".in"));
        out = new PrintWriter(System.out); // new PrintWriter(new FileOutputStream(".out"));
        solve();
        out.flush();
        out.close();
    }

    public static void main(String[] args) throws IOException {
        new Main().run();
    }
}
