class Solution {
    public int repeatedNTimes(int[] nums) {
        Set<Integer> set = new HashSet<>();
        for(int i: nums)
            if(set.contains(i))
                return i;
            else set.add(i);
        return -1;
    }
}