# include <iostream>
using namespace std;
# define LINE 102
int max(int a,int b)
{
if(a<b)
return b;
else
return a;
}
int main()
{
int N;
cin>>N;
int a[LINE][LINE];
int dp[LINE][LINE];
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
int i,j;
for(i=1;i<=N;i++){
for(j=1;j<=i;j++)
cin>>a[i][j];
}
dp[1][1]=a[1][1];
for(i=2;i<=N;i++){
for(j=1;j<=i;j++)
dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i][j];
}
int result=dp[N][1];
int m;
for(m=1;m<=N;m++)
{
if(result<dp[N][m]) result=dp[N][m];
}
cout<<result<<endl;
return 0;
}
using namespace std;
# define LINE 102
int max(int a,int b)
{
if(a<b)
return b;
else
return a;
}
int main()
{
int N;
cin>>N;
int a[LINE][LINE];
int dp[LINE][LINE];
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
int i,j;
for(i=1;i<=N;i++){
for(j=1;j<=i;j++)
cin>>a[i][j];
}
dp[1][1]=a[1][1];
for(i=2;i<=N;i++){
for(j=1;j<=i;j++)
dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i][j];
}
int result=dp[N][1];
int m;
for(m=1;m<=N;m++)
{
if(result<dp[N][m]) result=dp[N][m];
}
cout<<result<<endl;
return 0;
}