#include <set>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <bitset>
#include <algorithm>

#define INF 1e9

using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;

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

	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int n;
	cin >> n;

	vector <int> in(n);

	/* Static predecessor */
	for (int i = 0; i < n; i++) cin >> in[i];

	sort(in.begin(), in.end());

	for (auto item: in) cout << item << ' ';
	
	return 0;
}