Most Frequent Product

You are given a list of product IDs. Your task is to determine the product ID that appears most frequently in the list. In the event that multiple product IDs have the same highest frequency, you must output the smallest product ID. Formally, given an integer $n$ and a sequence of product IDs $a_1, a_2, \ldots, a_n$, find an integer $p$ such that the frequency of $p$ is maximized. If there exists another product $q$ with the same frequency and $q < p$, then output $q$.

inputFormat

The first line of input contains an integer $n$, representing the number of product IDs. The second line contains $n$ space-separated integers, each representing a product ID.

outputFormat

Output a single integer — the product ID that appears most frequently. If there are multiple such IDs, output the smallest one.## sample

7
4 4 1 2 2 4 1

4