#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 using namespace std;

 int d[][];

 int n;

 int fst,snd,ans;

 int main(){

     scanf("%d",&n);

     int i,j,x;

     for(i=;i<n;i++)

       for(j=i+;j<=n;j++)

       {

           scanf("%d",&d[i][j]);

           d[j][i]=d[i][j];

       }

     for(i=;i<=n;i++){

       fst=;snd=;

       for(j=;j<=n;j++){

           if(d[i][j]>fst){

               snd=fst;

               fst=d[i][j];

           }

         else if(d[i][j]>snd)snd=d[i][j];

         if(snd>ans)ans=snd;

       }

     }

     printf("1\n%d",ans);

     return ;

 }