You are given an array of NN values. It is guaranteed that NN is even and that each distinct value appears in the array exactly twice. On this array, you can perform the following operation: choose two adjacent numbers and swap them. Compute the minimum number of operations needed such that each pair of equal numbers will be adjacent. Standard input