Meal-Time Conflict Resolution

You are given an integer \(n\) representing the number of rabbits and a list of \(2n\) integers where each rabbit has exactly two preferred meal times. Your task is to determine the maximum number of rabbits that prefer the same meal time. In other words, find the maximum frequency \(f\) such that there exists a meal time occurring \(f\) times in the list.

Input Format: The first line contains an integer \(n\). The second line contains \(2n\) space-separated integers representing the preferred meal times.

Output Format: Output a single integer representing the maximum frequency of any meal time.

Example:

For \(n = 2\) and meal times 5 8 8 5, the result is \(2\) because both 5 and 8 appear twice.

inputFormat

The first line of input contains an integer \(n\) (the number of rabbits).

The second line contains \(2n\) integers, each representing a preferred meal time.

outputFormat

Output a single integer: the maximum number of rabbits that prefer the same meal time.

1
1 2

1