#include <iostream>
#include <algorithm>
using namespace std;
const int N = 510;
int a[N][N];
int n;
int Max2(int s[N])
{
sort(s + 1, s + n + 1);
return s[n - 1];
}
int main()
{
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];
}
}
int res = 0;
for(int i = 1; i <= n; i++)
{
res = max(res, Max2(a[i]));
}
cout << "1" << endl << res;
return 0;
}