#include <fstream>
#include <set>
#include <vector>
#include <random>
#include <chrono>
#include <cmath>
#include <queue>
#include <map>
#include <algorithm>
#define pb push_back
using namespace std;
using pii = pair<int,int>;

ifstream cin("algsort.in");
ofstream cout("algsort.out");

int n , v[500001];

bool comp( int &a , int &b )
{
    return a < b;
}

signed main(){

    cin >> n;

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

    sort(v+1,v+1+n,comp);

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

    return 0;
}