#include<iostream> 
#include<cstdio> 
#include<algorithm> 
using namespace std; 
int map[505][505],n,a,ans=0; 
int main() 
{ 
    freopen("sanguo.in","r",stdin);
	freopen("sanguo.out","w",stdout);
	cin >> n; 
	for (int i=1;i<=n;i++) 
	{ 
	    int max1=0,max2=0; 
		for (int j=i+1;j<=n;j++)  
		{ 
		    cin>>a; 
			map[i][j]=map[j][i]=a; 
		} 
	} 
	for (int i=1;i<=n;i++)  
	{ 
		int max1=0,max2=0;
		for (int j=1;j<=n;j++) 
		{ 
		    int a=map[i][j]; 
			if(a>max1) 
			{ 
				max2=max1; 
				max1=a; 
				continue; 
			}  
			if(a>max2)max2=a; 
		} 
		ans=max(ans,max2); 
	} 
	cout<<"1"<<endl; 
	cout<<ans; 
	return 0; 
}