#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
inline int read(){
    int t=1,num=0;char c=getchar();
    while(c>‘9‘||c<‘0‘){if(c==‘-‘)t=-1;c=getchar();}
    while(c>=‘0‘&&c<=‘9‘){num=num*10+c-‘0‘;c=getchar();}
    return num*t;
}
int a[501][501],n,f,s,ans=0;
int main()
{
    n=read();
    for(int i=1;i<n;i++)
        for(int j=i+1;j<=n;j++)
            a[i][j]=a[j][i]=read();
    for(int i=1;i<=n;i++){
        f=0;s=0;
        for(int j=1;j<=n;j++){
            if(i==j)continue;
            if(a[i][j]>f){
                s=f;f=a[i][j];
            }
            else if(a[i][j]>s)s=a[i][j];
        }
        ans=max(ans,s);
    }
    printf("1\n%d\n",ans);
    return 0;
}