#include <bits/stdc++.h>
#include <bitset>
using namespace std;
// priority_queue< ii, vector<ii>, greater<ii> > pq;  pq.push pq.pop pq.top;
// priority_queue por default ordena decrescente

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3fLL
#define NVI -1
#define db if(0)
#define pb push_back
#define EPS 1e-9
#define fst first
#define scd second
#define mp make_pair

typedef unsigned long long ull;
typedef long long ll;
typedef vector <int> vi;
typedef vector<vector<int > > vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<vector<pair<int, int> > > ve;
typedef pair<double,double> dd;

int n;
vector<vector<int > > v;
int pd[1005][1005];
int main(void){

	while(scanf("%d",&n) && n){
		v.clear();
		v.resize(n,vi());
		int aux;
		for(int x=0;x<n;x++){
			for(int y=0;y<=x;y++){
				cin>>aux;
				v[x].pb(aux);
			}
		}
		memset(pd,-1,sizeof pd);
		pd[0][0] = v[0][0];
		int sum;
		int maximo = 0;
		for(int x=1;x<n;x++){
			cout<<x<< " x\n";
			for(int y=0;y<=x;y++){
				cout<<y << " y\n";
				sum = v[x][y];
				if(y-1 >= 0){
					cout<<" ha " << pd[x-1][y-1]<<"\n";
					sum+= pd[x-1][y-1];

				}
				if(y < x) {
					cout<<" he " << v[x-1][y]<<"\n";
					sum += v[x-1][y];
				}
				pd[x][y] = sum;
				cout<<sum<<"\n";
				maximo = max(maximo,sum);
			}cout<<"---------\n";
		}
		cout<<maximo<<"\n";



	}



    return 0;
}