#include <fstream>
#include <vector>
using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

void Interclasare(vector<int> &v, int left, int right);
void MergeSort(vector<int> &v, int left, int right);

int main()
{
    int n, x;
    vector<int> v;
    // citesc vectorul
    fin >> n;
    for (size_t i = 0; i < n; i++)
    {
        fin >> x;
        v.push_back(x);
    }

    MergeSort(v, 0, n - 1);

    // afisez vectorul sortat
    for (size_t i = 0; i < n; i++)
        fout << v[i] << " ";
    return 0;
}

void MergeSort(vector<int>& v, int left, int right){
if(left < right){
    int mid = (left + right) / 2;
    MergeSort(v, left, mid);
    MergeSort(v, mid + 1, right);
    Interclasare(v, left, right);
    }
}
void Interclasare(vector<int>& v, int left, int right) {
	int mid = (left + right) / 2;
	int i = left, j = mid + 1;
	vector<int> w;
	while (i <= mid && j <= right) {
		if (v[i] < v[j])
			{w.push_back(v[i]);
			i++;
			}
		else
			{w.push_back(v[j]);
			j++;
			}
	}
	while (i <= mid)
		{w.push_back(v[i]);
		i++;
		}
	while (j <= right)
		{w.push_back(v[j]);
		j++;
		}

	for (i = left; i <= right; i++)
		v[i] = w[i - left];
}