#include<bits/stdc++.h>
#include<sstream>
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }

const ll     INF = 1000000000LL;
const ll     MOD = 1000000007LL;
const double EPS = 1E-12;

const int MAX_N = 100;
ll dp[MAX_N+1][MAX_N+1];
string str;
int n, m;
ll res;

template<typename T> ostream& operator <<(ostream& r, const vector<T> t){vrep(v,t)r<<*v<<(v+1==t.end()?"":" ");return r;}
template<typename T> ostream& operator <<(ostream& r, const pair<vector<T>, int> p){int n=p.second;minup(n,p.first.size());rep(i,n-1)r<<p.first[i]<<' ';r<<p.first[n-1];return r;}
template<typename T> ostream& operator <<(ostream& r, const pair<T*, int> p){int n=p.second-1;rep(i,n)r<<p.first[i]<<' ';return r<<p.first[n];}
template<typename T, size_t S> ostream& operator <<(ostream& r, const T (&a)[S]){rep(i,S-1)r<<a[i]<<' ';return r<<a[S-1];}


int main()
{
  while(getline(cin, str)){
    string tmp;
    istringstream stream(str);
    int m = 0;
    while(getline(stream, tmp, ',')){
      dp[n][m++] = strtoll(tmp.c_str(), NULL, 10);
    }
    n += 1;
  }

  int h = n / 2;
  rrep(i, 0,   h) erep(j, 0, i+1)   dp[i+1][j] += max(dp[i][j], dp[i][max(0, j-1)]);
  rrev(i, h+1, n) erep(j, 0, i-h+1) dp[i-1][j] += max(dp[i][j], dp[i][max(0, j-1)]);

  rep(i, h+1) maxup(res, dp[h][i]);
  //  printf("%lld\n", res);
  cout << res << endl;

  //  rep(i, n) cerr << mp(dp[i], n) << endl;

  return 0;
}