//KZNS
#include <cstdio>
#include <algorithm>
using namespace std;
#define Nmax 503
int N;
int ls[130000];
int v[130000];
int rd[130000][2];
int p = 0;
void rin() {
    scanf("%d", &N);
    for (int i = 1; i < N; i++) {
        for (int j = i+1; j <= N; j++) {
            scanf("%d", v + p);
            rd[p][0] = i;
            rd[p][1] = j;
            ls[p] = p;
            p++;
        }
    }
}
inline bool cmp(const int &a, const int &b) {
    return v[a] > v[b];
}
bool ud[Nmax] = {false};
void work() {
    sort(ls, ls+p, cmp);
    int u;
    int a, b;
    int ans;
    for (int i = 0; i < p; i++) {
        u = ls[i];
        a = rd[u][0];
        b = rd[u][1];
        if (ud[a] || ud[b]) {
            ans = v[u];
            break;
        }
        else {
            ud[a] = true;
            ud[b] = true;
        }
    }
    printf("1\n%d\n", ans);
}
int main() {
    freopen("sanguo.in", "r", stdin);
    freopen("sanguo.out", "w", stdout);
    rin();
    work();
    return 0;
}
//UBWH