You are given an array $A$ of length $n$. Find the most frequently appear value in $A$.
### Input
- The first line contains an integer $n$.
- The second line contains $n$ integers $A_i$.
### Output
- Print a single integer, the most frequent value. If there are more than 1 result, print the largest value.
### Constraints
- $1 \le n \le 10^5$.
- $|A_i| \le 10^5 $.
### Example
Input:
```
8
-1 2 3 2 2 3 -1 -1
```
Output:
```
2
```
