#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int max_path(vector<vector<int> > pyramid, int n) {
return 1;
}
int main() {
long long int n;
cin >> n;
vector<vector<int> > pyramid(n,vector<int>(n,0));
for (int i=0; i<n; i++) {
for(int j=0; j<=i; j++) {
cin >> pyramid[i][j];
}
}
cout << max_path(pyramid,n) << endl;
}
I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYXhfcGF0aCh2ZWN0b3I8dmVjdG9yPGludD4gPiBweXJhbWlkLCBpbnQgbikgewoJcmV0dXJuIDE7Cn0KCmludCBtYWluKCkgewoJbG9uZyBsb25nIGludCBuOwoJY2luID4+IG47Cgl2ZWN0b3I8dmVjdG9yPGludD4gPiBweXJhbWlkKG4sdmVjdG9yPGludD4obiwwKSk7Cglmb3IgKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJZm9yKGludCBqPTA7IGo8PWk7IGorKykgewoJCQljaW4gPj4gcHlyYW1pZFtpXVtqXTsKCQl9Cgl9Cgljb3V0IDw8IG1heF9wYXRoKHB5cmFtaWQsbikgPDwgZW5kbDsKfQ==