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