void insertionSort(int N, int arr[]) {
    int i,j;
    int value;
    for(i=1;i<N;i++)
    {
        value=arr[i];
        j=i-1;
        while(j>=0 && value<arr[j])
        {
            arr[j+1]=arr[j];
            j=j-1;
        }
        arr[j+1]=value;
    }
    for(j=0;j<N;j++)
    {
        printf("%d",arr[j]);
        printf(" ");
    }
}

function main() {
    // Enter your code here
}

/**
 * Typescript was corrupted and have no any codes, i was switch to Javascript
 * and copy it function to this test
 */
function loopInvariant(ar: number[]): void {
    for (let i = 1; i < ar.length; i++) {
        var value = ar[i];
        var j = i - 1;

        //while (j > 0 && ar[j] > value) { // Wrong here. changes "j > 0" to "j >= 0"
        while (j >= 0 && ar[j] > value) {
            ar[j + 1] = ar[j];
            j = j - 1;
        }
        ar[j + 1] = value;
    }
    console.log(ar.join(' '));
}

function main() {
    const n: number = parseInt(readLine().trim(), 10);

    const arr: number[] = readLine().replace(/\s+$/g, '').split(' ').map(arrTemp => parseInt(arrTemp, 10));

    loopInvariant(arr);
}