// Java program to find

// minimum number of swaps

// required to sort an array

import java.util.*;

import java.io.*;

class GfG

{

    // Return the minimum number

    // of swaps required to sort the array

    public int minSwaps(int[] arr, int N)

    {

        int ans = 0;

        int[] temp = Arrays.copyOfRange(arr, 0, N);

        // Hashmap which stores the

        // indexes of the input array

        HashMap<Integer, Integer> h

            = new HashMap<Integer, Integer>();

        Arrays.sort(temp);

        for (int i = 0; i < N; i++)

        {

            h.put(arr[i], i);

        }

        for (int i = 0; i < N; i++)

        {

            // This is checking whether

            // the current element is

            // at the right place or not

            if (arr[i] != temp[i])

            {

                ans++;

                int init = arr[i];

                // If not, swap this element

                // with the index of the

                // element which should come here

                swap(arr, i, h.get(temp[i]));

                // Update the indexes in

                // the hashmap accordingly

                h.put(init, h.get(temp[i]));

                h.put(temp[i], i);

            }

        }

        return ans;

    }

    public void swap(int[] arr, int i, int j)

    {

        int temp = arr[i];

        arr[i] = arr[j];

        arr[j] = temp;

    }

}

// Driver class

class Main

{

    // Driver program to test the above function

    public static void main(String[] args)

                           throws Exception

    {

        int[] a

            = { 101, 758, 315, 730, 472,

                        619, 460, 479 };

        int n = a.length;

        // Output will be 5

        System.out.println(new GfG().minSwaps(a, n));

    }

}

// This code is contributed by Satvik Nema