Just do it

#include <bits/stdc++.h>

using namespace std;

int median(int a, int b, int c) {
    vector<int> arr = {a,b,c};
    sort(arr.begin(), arr.end());
    return arr[1];
}

int hiit_sort(vector<int> array, int low, int high) {
    if (high -low > 1) {
        int pivot = median(array[low], array[(low + high) / 2], array[high-1]);

        int a = low;
        int b = high;

        int count = 0;

        while(1) {
            while (array[a] < pivot) {
                a++;
                count++;
            }
            while (array[b] > pivot) {
                b++;
                count++;
            }
            if (a >= b) {
                break;
            }
            swap(array[a], array[b]);
            a++;
            b--;
        }
        count += hiit_sort(array, low, a);
        count += hiit_sort(array, a, high);
        return count;
    }
    else {
        return 0;
    }
}

int main()
{
    int n;
    cin >> n;

    vector<int> result(n);
    result[0] = 1;
    for(int i = 1; i < n-1; i++) {
        result[i] = i+2;
    }
    result[n-1] = 2;

    // int half_n = n / 2;

    // if (n % 2 == 1) {
    //     half_n++;
    // }

    // for(int i = 0; i < half_n; i++) {
    //     result[i] = i*2+1;
    // }
    // for (int i = 0; i < n / 2;  i++) {
    //     result[half_n + i] = (1 + i) * 2;
    // }

    for (int i = 0; i < n; i++) {
        cout << result[i] << " ";
    }
    cout << endl;

    // cout << hiit_sort(result, 0, n);
    return 0;


}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED