#include <iostream>
#include <algorithm>
#include <cstring>
int a[1001][1001];
int f[1000][1000];
int n;
using namespace std;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i; j++)
cin >> a[i][j];
for (int i = n; i >= 1; i--)
for (int j = 1; j <= i; j++)
f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + a[i][j];
cout << f[1][1];
return 0;
}