#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



int n;
int a[1000][1000];
int dp[1000][1000];

string str;

int main() {
    //freopen( "/Users/macuser/Dropbox/Contest/input.in", "r", stdin );
    
    memset(a, 0, sizeof(a));
    n = 0; 
    int last = -1;
    while (cin >> str) {
        int tmp;
        for (int i = 0; i < str.size(); ++i) if (str[i] == ',') str[i] = ' ';
        istringstream sin(str);
        vint vec;
        while (sin >> tmp) vec.PB(tmp);
        
        if (vec.size() != n+1 && last == -1) {
            last = n;
        }
        
        if (last != -1) {
            reverse(ALL(vec));
            while (vec.size() < last) vec.PB(0);
            reverse(ALL(vec));
        }
        
        for (int i = 0; i < vec.size(); ++i) a[n][i] = vec[i];
        ++n;
    }
    
    //for (int i = 0; i <= n; ++i) { for (int j = 0; j <= n; ++j) cout << a[i][j] << ", "; cout << endl; }
    
    memset(dp, -1, sizeof(dp));
    dp[0][0] = a[0][0];
    
    int res = -1;
    for (int i = 0; i <= n; ++i) for (int j = 0; j <= n; ++j) {
        chmax(dp[i+1][j], dp[i][j] + a[i+1][j]);
        chmax(dp[i+1][j+1], dp[i][j] + a[i+1][j+1]);
        chmax(res, dp[i+1][j]);
        chmax(res, dp[i+1][j+1]);
    }
    cout << res << endl;
    
    return 0;
}
