
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n);
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); ++i)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define MIN(p1,p2)          (((p1)<(p2))?(p1):(p2))
#define MAX(p1,p2)          (((p1)>(p2))?(p1):(p2))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define mp                  make_pair
#define pb                  push_back

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
#define pf printf
#define pr(n) do { cout << #n " = " << (n) << endl; } while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#endif

void solve(vector< vector<int> > &vvi){
    int h = vvi.size();
    int w = (h+1)/2;
    pr(w);
    pr(h);

    REP(i,w-1){
        vector<int> v1(vvi[i+1].size());
        vector<int> v2(vvi[h-i-2].size());
        REP(j,i+1){
            v1[j+0] = MAX(v1[j+0], vvi[i][j]);
            v1[j+1] = MAX(v1[j+1], vvi[i][j]);
            v2[j+0] = MAX(v2[j+0], vvi[h-i-1][j]);
            v2[j+1] = MAX(v2[j+1], vvi[h-i-1][j]);
        }
        REP(j,vvi[i+1].size()){
            vvi[i+1][j] += v1[j];
            vvi[h-i-2][j] += v2[j];
        }
    }
    int max = 0;
    REP(i,vvi[w-1].size()){
        max = MAX(max, vvi[w-1][i]);
    }
    cout << max << endl;
}

int main(){
    string s;
    vector< vector<int> > vvi;
    while(getline(cin,s)){
        FOREACH(it, s){
            if(*it == ',') *it = ' ';
        }
        stringstream ss(s);
        vector<int> vi;
        int n;
        while(ss >> n) vi.pb(n);
        vvi.pb(vi);
    }

    solve(vvi);
    return 0;
}