#include<iostream>#include<algorithm>#include<cstdio>#include<cstdlib>#include<queue>#include<vector>#include<cstring>#include<cmath>#include<map>using namespace std;typedef long long ll;#define N 2011111ll mm[222][222];int main(){    ll n,m=-1;    cin>>n;    for(int i=0;i<n;i++){        for(int j=0;j<=i;j++){            cin>>mm[i][j];            if(i>0){                if(i==j)mm[i][j]+=mm[i-1][j-1];                else if(j==0)mm[i][j]+=mm[i-1][j];                else mm[i][j]+=max(mm[i-1][j],mm[i-1][j-1]);            }            m=max(m,mm[i][j]);        }    }    cout<<m<<endl;    return 0;}