this is coding question

Problem Statement You are given an array A of size N. It is guaranteed that N is even and that each distinct value appears in the A exactly twice. In one operation, you can choose two adjacent numbers in A and swap them. Find the minimum number of operations needed such that each pair of equal numbers will be adjacent. Input Format The first line contains an integer, N, denoting the number of elements in A. Each line i of the N subsequent lines (where 0I<>