Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊n/2⌋ times.
The first line contains number n (1≤n≤100). The second line contains n positive integers.
If the array contains majority element, then print it. Otherwise print −1.