import java.lang.Math;
import java.util.Scanner;

class submission{
  // pyramid[r][c] containts the element in row r and column c for 0 <= c <= r < n.
  public static int max_path(int[][] pyramid, int n) {
    return 1;
  }

  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
    int[][] pyramid = new int[n][n];
    for (int i=0; i<n; i++)
      for (int j=0; j<=i; j++)
        pyramid[i][j]=in.nextInt();

    System.out.println(max_path(pyramid, n));
  }
}