#include <fstream>
#include <algorithm>

using namespace std;

int n, a [ 100009 ], best [ 100009 ], indBest [ 100009 ];

int main(){
    //suppose there are no negative numbers
    int i, j;
    ifstream f ( "avioane.in" );
    ofstream g ( "avioane.out" );
    f >> n;
    for ( i = 0; i < n; ++ i )
        f >> a [ i ];
    f.close();
    sort ( a, a + n );
    g.close();
    return 0;
}