Blow Out the Candles

You are given a list of candle heights, and your task is to determine the maximum number of candles that can be blown out. You can only blow out candles that have the same height.

In mathematical terms, given an array \( candles \) where \( candles[i] \) represents the height of the \( i\text{th} \) candle, find the maximum frequency \( f \) such that there exists a height \( h \) for which there are exactly \( f \) candles of height \( h \). Formally, if \( c_h \) is the count of candles with height \( h \), you need to determine \( \max_h c_h \).

inputFormat

The input is provided via standard input (stdin) in two lines. The first line contains a single integer \( n \) (\(1 \le n \le 10^5\)) — the number of candles. The second line contains \( n \) space-separated integers, where each integer represents the height of a candle.

outputFormat

Output a single integer via standard output (stdout) representing the maximum number of candles that can be blown out (i.e. the maximum frequency among candle heights).

5
4 4 1 3 4

3