#include <iostream>
#include <fstream>
#include <vector>
#include <set>

using namespace std;

int n;
int d[190], c[401];
int t[20][20];
set< vector<int> > S;

void search(int L, int R){
	if(L+1==R){
		vector<int> v;
		for(int i=0;i+1<n;i++)
			v.push_back(t[i][i+1]);
		S.insert(v);
		return ;
	}
	int idx = 0;
	while(c[d[idx]]==0) idx++;
	c[d[idx]]--;
	
	bool check = true;
	t[0][R-1] = t[R-1][0] = d[idx];
	for(int i=1;i<n;i++){
		if(L<i&&i<R) continue;
		if(c[t[i][R-1] = t[R-1][i] = abs(t[0][R-1]-t[0][i])]==0) check = false;
		c[t[i][R-1]]--;
	}
	if(check) search(L, R-1);
	for(int i=1;i<n;i++)
		if(i<=L||R<=i) c[t[i][R-1]]++;

	check = true;
	t[L+1][n-1] = t[n-1][L+1] = d[idx];
	for(int i=0;i+1<n;i++){
		if(L<i&&i<R) continue;
		if(c[t[i][L+1] = t[L+1][i] = abs(t[i][n-1]-t[L+1][n-1])]==0) check = false;
		c[t[i][L+1]]--;
	}
	if(check) search(L+1, R);
	for(int i=0;i+1<n;i++)
		if(i<=L||R<=i) c[t[i][L+1]]++;

	c[d[idx]]++;
}

int main(){
	ifstream fin("C.in");
	while(fin >> n, n){
		S.clear();
		memset(c, 0, sizeof(c));
		for(int i=0;i<n*(n-1)/2;i++){
			fin >> d[i];
			if(i!=0) c[d[i]]++;
		}
		t[0][n-1] = t[n-1][0] = d[0];
		search(0, n-1);
		for(set< vector<int> >::iterator it=S.begin();it!=S.end();it++){
			for(int i=0;i+1<it->size();i++)
				cout << (*it)[i] << " ";
			cout << it->back() << endl;
		}
		puts("-----");
	}
}