#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define maxn 501
using namespace std;
class edge{
public:
	int from,to,dis;
	bool operator < (const edge e)const{
		return dis>e.dis;
	}
};
vector<edge> edges;
int n,m;
int col[maxn]={0};
void read(){
	scanf("%d",&n);
	int w;
	for (int i=1;i<=n;i++){
		for (int j=i+1;j<=n;j++){
			scanf("%d",&w);
			edges.push_back((edge){i,j,w});
		}
	}
	sort(edges.begin(),edges.end());
	for (int i=0;i<edges.size();i++){
		edge e=edges[i];
		if (col[e.from]==0&&col[e.to]==0){
			col[e.from]=1;
			col[e.to]=1;
			continue;
		}
		if (col[e.from]==1&&col[e.to]==1) continue;
		if (col[e.from]==1||col[e.to]==1){
			printf("1\n%d",e.dis);
			return;
		}
	}
	printf("0");
}
int main(){
	freopen("sanguo.in","r",stdin);
	freopen("sanguo.out","w",stdout);
	read();
	return 0;
}