#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;
}