Bob is given an array of N distict elements and asked to rearrange the elements in this array $.$So as to maximize the score of the array.Given an array A of N distinct elementss, where N is an event number and A$1,$ a$2,$a$3,$a$4,......$A$[$n$-1],$ A$[$N$]$ are the elements of array A$,$ the score of this array is $(($A$1+$A$2)($A$3+$A$4)($A$5+$A$6)....)$Bob can rearrange the array by performing any number of swap operations.In a swap operation bob can choose any two elements from the array and swap their positions.Your task is to help bob find the minimum number of swaps required to get the maximum score for given arrayNote:It is guaranteed that N is an even numberInput format:$-$The first line contains an integer N denoting the number of elements in AR$-$Each line i of the N subsequent lines $($where $0<=$j