#include <iostream>
#include <math.h>

using namespace std;

void sorting(int, int*);
int main()
{
    int n;
    cin >> n;
    int *mass = new int[n];
    for (int i = 0; i < n; i++)
        cin >> mass[i];
    sorting(n, mass);
    for (int i = 0; i < n; i++)
        cout << mass[i] << " ";
    cout << endl;
    return 0;
}

void sorting(int n, int *mass)
{
    for (int i = 0; i < n-1; i++)
        for (int j = i+1; j < n; j++)
            if (fabs(mass[i]) > fabs(mass[j]))
            {
                int tmp = mass[i];
                mass[i] = mass[j];
                mass[j] = tmp;
            }
}