#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <ctime>
using namespace std;

#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long int ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;

namespace std {
    bool operator<(const P a, const P b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

int main() {
    vector<int> a[101];
    string s;
    int cnt = 0;
    while(cin >> s) {
        replace(s.begin(), s.end(), ',', ' ');
        stringstream ss(s);
        while(ss >> s) a[cnt].push_back(stoi(s));
        cnt++;
    }
    
    int dp[101][101];
    if(cnt == 1) cout << a[0][0] << endl;
    else {
        dp[0][0] = a[0][0];
        dp[1][0] = dp[0][0] + a[1][0];
        dp[1][1] = dp[0][0] + a[1][1];
        rep(i,2,cnt) rep(j,0,a[i].size()) {
            if(j != 0 && j != a[i].size() - 1 && i <= cnt / 2) dp[i][j] = a[i][j] + max(dp[i-1][j-1], dp[i-1][j]);
            else if(j != 0 && j != a[i].size() - 1 && i > cnt / 2) dp[i][j] = a[i][j] + max(dp[i-1][j+1], dp[i-1][j]);
            else if(j == 0 && i <= cnt / 2) dp[i][j] = a[i][j] + dp[i-1][j];
            else if(j == 0 && i > cnt / 2) dp[i][j] = a[i][j] + max(dp[i-1][j+1], dp[i-1][j]);
            else if(j == a[i].size() - 1 && i <= cnt / 2) dp[i][j] = a[i][j] + dp[i-1][j-1];
            else if(j == a[i].size() - 1 && i > cnt / 2) dp[i][j] = a[i][j] + max(dp[i-1][j+1], dp[i-1][j]);
        }
        
        cout << dp[cnt-1][0] << endl;   
    }
    return 0;
}