#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

signed main(void) {
    vector<vi> in;
    string s;
    while(getline(cin,s)){
        vi t;
        int num = 0;
        rep(i,s.size()){
            if(s[i] == ','){
                t.push_back(num);
                num = 0;
            }else{
                num *= 10;
                num += s[i] - '0';
            }
        }
        t.push_back(num);
        in.push_back(t);
    }
    int n = in.size();
    vector<vi> ans = in;
    loop(i,1,n)rep(j,in[i].size())ans[i][j] = 0;

    rep(i,n/2)rep(j,ans[i].size()){
        ans[i+1][j] = max(ans[i+1][j], ans[i][j] + in[i+1][j]);
        ans[i+1][j+1] = max(ans[i+1][j+1], ans[i][j] + in[i+1][j+1]);
    }
    rep(k,n/2){
        int i = n/2+k+1;
        rep(j,in[i].size()){
            ans[i][j] = max(ans[i-1][j], ans[i-1][j+1]) + in[i][j];
        }
    }
    cout << ans.back().back() << endl;
}

