#include <bits/stdc++.h>
using namespace std;

int n, mp[605][605], max2n[605], maxm2n;

int main() {	
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		for (int j = 1; j <= n; j++) {
			if (i == j) continue;
			if (j <= i) mp[i][j] = mp[j][i];
			else scanf("%d", &mp[i][j]);
			mp[i][0] = max(mp[i][0], mp[i][j]);
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (mp[i][j] ^ mp[i][0]) max2n[i] = max(max2n[i], mp[i][j]); 
		}
		maxm2n = max(maxm2n, max2n[i]);
	}
	
	printf("1\n%d", maxm2n);
	
	return 0;
}