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.
/**
 * Built using Sublime,Custom Python and Batch files
 * @author Siddhraj Sisodiya
 */

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

public class Main 
{
   public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        InputReader in = new InputReader(inputStream);
        Task solver = new Task(in);
        solver.solve();
    }

    static class Task
    {
        InputReader in;

        Task(InputReader in)
        {
            this.in=in;
        }

        public void solve()
        {
            int n=in.nextInt();
            HashMap<Integer,Integer> m=new HashMap<>();
            int max=0;

            for(int i=0;i<n;i++)
            {
                int temp=in.nextInt();
                if(m.get(temp)==null)
                {
                    m.put(temp,1);
                }
                else
                {
                    int val=m.get(temp);
                    val++;
                    m.put(temp,val);
                }
                if(m.get(temp)>max)
                    max=m.get(temp);
            }

            System.out.println(max);


        }
    }

    static class InputReader 
    {
        private boolean finished = false;

        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) 
        {
            this.stream = stream;
        }

        public int read() 
        {
            if (numChars == -1) 
            {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) 
            {
                curChar = 0;
                try 
                {
                    numChars = stream.read(buf);
                } catch (IOException e) 
                {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) 
                {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int peek() 
        {
            if (numChars == -1) 
            {
                return -1;
            }
            if (curChar >= numChars) 
            {
                curChar = 0;
                try 
                {
                    numChars = stream.read(buf);
                } catch (IOException e) 
                {
                    return -1;
                }
                if (numChars <= 0) 
                {
                    return -1;
                }
            }
            return buf[curChar];
        }

        public int nextInt() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do 
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nextLong() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do 
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do 
            {
                if (Character.isValidCodePoint(c)) 
                {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) 
        {
            if (filter != null) 
            {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) 
        {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private String readLine0() 
        {
            StringBuilder buf = new StringBuilder();
            int c = read();
            while (c != '\n' && c != -1) 
            {
                if (c != '\r') 
                {
                    buf.appendCodePoint(c);
                }
                c = read();
            }
            return buf.toString();
        }

        public String readLine() 
        {
            String s = readLine0();
            while (s.trim().length() == 0) 
            {
                s = readLine0();
            }
            return s;
        }

        public String readLine(boolean ignoreEmptyLines) 
        {
            if (ignoreEmptyLines) 
            {
                return readLine();
            } else 
            {
                return readLine0();
            }
        }

        public BigInteger readBigInteger() 
        {
            try 
            {
                return new BigInteger(nextString());
            } catch (NumberFormatException e) 
            {
                throw new InputMismatchException();
            }
        }

        public char nextCharacter() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            return (char) c;
        }

        public double nextDouble() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') 
            {
                if (c == 'e' || c == 'E') 
                {
                    return res * Math.pow(10, nextInt());
                }
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') 
            {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) 
                {
                    if (c == 'e' || c == 'E') 
                    {
                        return res * Math.pow(10, nextInt());
                    }
                    if (c < '0' || c > '9') 
                    {
                        throw new InputMismatchException();
                    }
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public boolean isExhausted() 
        {
            int value;
            while (isSpaceChar(value = peek()) && value != -1) 
            {
                read();
            }
            return value == -1;
        }

        public String next() 
        {
            return nextString();
        }

        public SpaceCharFilter getFilter() 
        {
            return filter;
        }

        public void setFilter(SpaceCharFilter filter) 
        {
            this.filter = filter;
        }

        public interface SpaceCharFilter 
        {
            public boolean isSpaceChar(int ch);
        }
        public int[] nextIntArray(int n)
        {
            int[] array=new int[n];
            for(int i=0;i<n;++i)array[i]=nextInt();
            return array;
        }
        public int[] nextSortedIntArray(int n)
        {
            int array[]=nextIntArray(n);
            Arrays.sort(array);
            return array;
        }
        public int[] nextSumIntArray(int n)
        {
            int[] array=new int[n];
            array[0]=nextInt();
            for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();
            return array;
        }
        public long[] nextLongArray(int n)
        {
            long[] array=new long[n];
            for(int i=0;i<n;++i)array[i]=nextLong();
            return array;
        }
        public long[] nextSumLongArray(int n)
        {
            long[] array=new long[n];
            array[0]=nextInt();
            for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();
            return array;
        }
        public long[] nextSortedLongArray(int n)
        {
            long array[]=nextLongArray(n);
            Arrays.sort(array);
            return array;
        }
    }
}

