Not Exactly Twice
In this problem, you are given a list of numbers. Of all the numbers in the list, can you identify the smallest number that does not appear exactly two times?
Hint: consider using std::vector for this problem.
Input
First, you are given an integer \(1 \leq n \leq 10\), representing the amount of integers in the list.
Then, you are given \(n\) integers \(1 \leq a_i \leq 10\), each representing an individual element of the list.
You will never be given an input that does not have an answer. There will always be at least one number that does not appear exactly two times.
Output
The output consists of a single integer: the smallest integer in the list that does not appear exactly two times.
Examples
Example 1
Input:
3
1 2 2
Output:
1
Example 2
Input:
4
1 2 1 3
Output:
2
Example 3
4
1 3 1 1
Output:
1
Comments