#include <bits/stdc++.h>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;
	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}
	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;
    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("algsort.in");
OutParser fout("algsort.out");

void quicksort(int a[], int st, int dr) {
	if(st < dr) {
		int mid = (st + dr) >> 1;
		swap(a[st], a[mid]);
		int i = st , j = dr, d = 0;
		while(i < j) {
			if(a[i] > a[j]) {
				swap(a[i], a[j]);
				d = !d;
			}
			i += d;
			j -= !d;
		}
		quicksort(a, st , i - 1);
		quicksort(a, i + 1, dr);
	}
}

const int NMAX = 5e5 + 5;
int N, a[NMAX];

int main() {
    fin >> N;
    for(int i = 1; i <= N; ++i)
        fin >> a[i];
    quicksort(a, 1, N);
    for(int i = 1; i <= N; ++i)
        fout << a[i] << ' ';
}