#include <cstdio>
#include <algorithm>
#define MAXN 500005
#define FIN "algsort.in"
#define FOUT "algsort.out"

using namespace std;

class SORT {

      public: 
      int *p, 
           n;
  
      SORT(int arr[], int num) {
 
          p = arr;  
          n = num;
      }
      
      void sorte() {
 
          sort(p + 1, p + 1 + n);
      } 

      int* get() {

           return p;
      }
};

int main() {

    int arr[MAXN],
        n,
        *x;

    freopen(FIN, "r", stdin);

    scanf("%d", &n); 

    for(int i = 1; i <= n; i++ ) scanf("%d ", &arr[ i ]);

    fclose( stdin );
     
    SORT s( arr, n ); 

    s.sorte();

    x = s.get();

    freopen(FOUT, "w", stdout);

    for(int i = 1; i <= n; i++ ) printf("%d ", x[ i ]);

    fclose( stdout );

    return(0);
}