int countSwaps(vector<int> arr, vector<int> sortedArr) {
    int n = arr.size();
    unordered_map<int, int> indexMap;

    // Mapping each value to its index in the sorted array
    for (int i = 0; i < n; i++)
        indexMap[sortedArr[i]] = i;

    vector<bool> visited(n, false);
    int swaps = 0;

    for (int i = 0; i < n; i++) {
        // If already visited or already in the correct position, skip
        if (visited[i] || indexMap[arr[i]] == i)
            continue;

        // Cycle detection
        int cycleSize = 0;
        int j = i;
        while (!visited[j]) {
            visited[j] = true;
            j = indexMap[arr[j]];
            cycleSize++;
        }

        // A cycle of size k requires (k-1) swaps
        if (cycleSize > 1)
            swaps += (cycleSize - 1);
    }

int lilysHomework(vector<int> arr) {
    vector<int> sortedArr = arr;

    // Sort in ascending order and count swaps
    sort(sortedArr.begin(), sortedArr.end());
    int swapsAsc = countSwaps(arr, sortedArr);

    // Sort in descending order and count swaps
    sort(sortedArr.begin(), sortedArr.end(), greater<int>());
    int swapsDesc = countSwaps(arr, sortedArr);

    // Return minimum of the two
    return min(swapsAsc, swapsDesc);
}






    return swaps;
}

#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'lilysHomework' function below.
#
# The function is expected to return an INTEGER.
# The function accepts INTEGER_ARRAY arr as parameter.
#

def countSwaps(arr, r):
    arr = arr.copy()
    target = sorted(arr, reverse = r)
    inds = {v:i for i,v in enumerate(target)}
    i = 0
    count = 0
    while i < len(arr) and arr != target:
        while arr[i] != target[i]:
            ind = inds[arr[i]]
            arr[i], arr[ind] = arr[ind], arr[i]
            count += 1
        i += 1
    return count

def lilysHomework(arr):
    #Write your code here
    return min(countSwaps(arr, False), countSwaps(arr, True))

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input().strip())

    arr = list(map(int, input().rstrip().split()))

    result = lilysHomework(arr)

    fptr.write(str(result) + '\n')

    fptr.close()

#include <bits/stdc++.h>
/*
 * Difficulty Medium
 * Max Score 40
 * https://www.hackerrank.com/challenges/lilys-homework/
 */

using namespace std;

vector <string> split_string(string);

// Complete the lilysHomework function below.
int lilysHomework(vector<int> arr_orig) {
    int result = INT_MAX;


    vector<int> sorted(arr_orig);
    sort(sorted.begin(), sorted.end(), greater<int>());

    for (int rev = 0; rev < 2; rev++) {
        int curSwap = 0;
        if (rev) {
            reverse(sorted.begin(), sorted.end());
        }
        vector<int> arr(arr_orig);
        // val, pos
        unordered_map<int, int> val2pos;
        for (int i = 0; i < arr.size(); i++) {
            val2pos[arr[i]] = i;
        }


        for (int i = 0; i < arr.size(); i++) {
            if (arr[i] == sorted[i]) {
                continue;
            }
            int ai = arr[i];
            int si = sorted[i];

            swap(arr[i], arr[val2pos[si]]);
            curSwap++;


            val2pos[ai] = val2pos[si];
            val2pos[si] = i;


        }

        result = min(result, curSwap);

    }


    return result;


}

int main() {
    ofstream fout(getenv("OUTPUT_PATH"));

    int n;
    cin >> n;
    cin.ignore(numeric_limits<streamsize>::max(), '\n');

    string arr_temp_temp;
    getline(cin, arr_temp_temp);

    vector <string> arr_temp = split_string(arr_temp_temp);

    vector<int> arr(n);

    for (int i = 0; i < n; i++) {
        int arr_item = stoi(arr_temp[i]);

        arr[i] = arr_item;
    }

    int result = lilysHomework(arr);

    fout << result << "\n";

    fout.close();

    return 0;
}

vector <string> split_string(string input_string) {
    string::iterator new_end = unique(input_string.begin(), input_string.end(), [](const char &x, const char &y) {
        return x == y and x == ' ';
    });

    input_string.erase(new_end, input_string.end());

    while (input_string[input_string.length() - 1] == ' ') {
        input_string.pop_back();
    }

    vector <string> splits;
    char delimiter = ' ';

    size_t i = 0;
    size_t pos = input_string.find(delimiter);

    while (pos != string::npos) {
        splits.push_back(input_string.substr(i, pos - i));

        i = pos + 1;
        pos = input_string.find(delimiter, i);
    }

    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

    return splits;
}