#include <queue>
#include<cmath>
#include <iostream>
using namespace std;
struct cmp{
bool operator()(int &a,int &b) const{
return abs(a)<abs(b);
}
};
priority_queue<int,vector<int>,cmp> q[100];
int main()
{
int n,a,j=0;
while(scanf("%d",&n)!=EOF){
if(n==0) continue;
for(int i=0;i<n;i++){
cin>>a;
q[j].push(a);
}
j++;
}
for(int i=0;i<j;i++){
while(!q[i].empty()){
cout<<q[i].top()<<' ';
q[i].pop();
}
cout<<endl;
}
}
0.0分
0 人评分