#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

const int NMAX = 500005;

int N;
vector<int> vec(NMAX, 0);

int main() {
   freopen("algsort.in", "r", stdin);
   freopen("algsort.out", "w", stdout);

   scanf("%d", &N);

   for (int i = 0; i < N; ++i) {
      int val;
      scanf("%d", &val);
      vec[i] = val;
   }

   sort(vec.begin(), vec.begin() + N);

   for (int  i = 0; i < N; ++i) {
      printf("%d ", vec[i]);
   }

   fclose(stdin);
   fclose(stdout);
   return 0;
}