#C10060. Count Unique Elements
Count Unique Elements
Count Unique Elements
Given an array of integers, an element is considered unique if it appears exactly once. Your task is to compute the number of unique elements in the given array. Formally, if an element (x) appears exactly one time in the array, then it is counted as unique. For example, in the array [1, 2, 2, 3, 4, 4, 5], the unique elements are 1, 3, and 5, so the result is 3.
inputFormat
The first line of input contains a single integer (n) indicating the number of elements in the array. The second line contains (n) space-separated integers representing the elements of the array.
outputFormat
Output a single integer which is the count of unique elements (elements that appear exactly once) in the array.## sample
7
1 2 2 3 4 4 5
3