#Algorithm Sort

Insert Sort

//
// Created by 김태희 on 2019-04-05.
//

#include <iostream>

using namespace std;

int main(){

    int n;
    int loc;
    int Item;

    cin >> n;

    int arr[n];

    for(int i = 0; i < n; i++){
        cin >> arr[i];
    }

    for(int i = 1; i < n; i++){
        loc = i-1;
        Item = arr[i];
        while(loc >= 0 && Item < arr[loc]){
            arr[loc + 1] = arr[loc];
            loc--;
        }
        arr[loc+1] = Item;
    }


    for(int i = 0; i < n; i++){
        cout << arr[i] << ' ';
    }



    return 0;
}