#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void quicksort(vector<int> &s, int left, int right) {
if (left > right)
return;
int i = left;
int j = right;
int b = left + rand() % (right - left + 1);
swap(s[left], s[b]);
while (i < j) {
while (i < j && abs(s[j]) <= abs(s[left]))
j--;
while (i < j && abs(s[i]) >= abs(s[left]))
i++;
swap(s[i], s[j]);
}
swap(s[left], s[i]);
quicksort(s, left, i - 1);
quicksort(s, i + 1, right);
}
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
vector<int> ans;
int i, num;
for (i = 0; i < n; i++) {
cin >> num;
ans.push_back(num);
}
quicksort(ans, 0, ans.size() - 1);
// 输出程序
cout << ans[0];
for (int i = 1; i < n; i++) {
cout << " " << ans[i];
}
cout << endl;
}
return 0;
}