/*
TASK:oldmap
LANG:C++
*/
#include<iostream.h>

long int a[500][500],n;
int d[500][500];

void solve()
{
	int i,j,k;
	for(k=0;k<n;k++)
		for(i=0;i<n;i++)
			if(i!=k)
				for(j=0;j<n;j++)
					if(i!=j&&j!=k&&(a[i][j]>=a[i][k]+a[k][j]))
					{
						a[i][j]=a[i][k]+a[k][j];
						a[j][i]=a[i][j];
						d[i][j]=1;
						d[j][i]=1;
					}
}

int main()
{
	int i,j;
	cin>>n;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			cin>>a[i][j];
	solve();
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
			if(d[i][j]==0)
				cout<<i+1<<" "<<j+1<<" "<<a[i][j]<<endl;
	return 0;
}