#include <cstdio>
#include <ctime>
#include <algorithm>

using namespace std;

#define MAX_N 500000

int v[MAX_N], n;

bool sorted() {
    for ( int i = 0; i < n - 1; ++i )
        if ( v[i] > v[i + 1] )
            return false;

    return true;
}

int main() {
    srand( time( 0 ) );
    FILE *fin, *fout;

    fin = fopen( "algsort.in", "r" );
    fscanf( fin, "%d", &n );
    for ( int i = 0; i < n; ++i )
        fscanf( fin, "%d", &v[i] );
    fclose( fin );

    //int count = 0;
    while ( !sorted() ) {
        //++count;
        random_shuffle( v, v + n );
    }

    fout = fopen( "algsort.out", "w" );
    for ( int i = 0; i < n; ++i )
        fprintf( fout, "%d ", v[i] );
    //fprintf( fout, "%d", count );
    fclose( fout );
}