#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1e5;

int n;
int q[N];


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

    for (int i = 0; i < n; i ++) {
        int min = i;
        bool swaped = false;
        for (int j = i + 1; j < n; j ++) {
            if (q[j] < q[min]) {
                min = j;
                swaped = true;
            }
        }
        if (swaped) swap(q[i], q[min]);
    }

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

    return 0;
}