// my BogoSort
using namespace std;
#include <fstream>
#include <vector>
#include <algorithm>
#include <ctime>
#define pb push_back
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int sorted(vector<int> v)
{
    vector<int>::iterator I = ++v.begin(), J = v.begin();
    for( ; I < v.end(); I++)
    {
        if(*I<=*J)
            return 0;
        J=I;
    }
    return 1;
}

int main()
{
    srand ( unsigned ( time (NULL) ) );
    int n, i, x;
    vector<int> v;

    fin>>n;
    for(i = 1; i <= n; i++)
    {
        fin>>x;
        v.pb(x);
    }
    while(!sorted(v))
    {
        random_shuffle(v.begin(), v.end());
    }
    for( vector<int>::iterator I = v.begin(); I < v.end(); I++)
        fout<<*I<<" ";
    return 0;
}