#include <cstdio>
#include <iostream>
using namespace std;

void insertionSort(int* arr, int n) {
    for (int i = 1; i < n; i++) {
        int j = i;
        while (j > 0 && arr[j] < arr[j - 1]) {
            swap(arr[j], arr[j - 1]);
            j--;
        }
    }
}

void printArray(int* arr, int n) {
    if (n > 0) printf("%d", arr[0]);
    for (int i = 1; i < n; i++) {
        printf(" %d", arr[i]);
    }
    printf("\n");
}

int main() {
    int n = 8;
    int arr[] = {3, 1, 30, 2, -7, 9, -6, 4};

    insertionSort(arr, n);
    printArray(arr, n);

    return 0;
}