#include<bits/stdc++.h>

using namespace std;

#define MAXN 16

const int MAXS = ;

int i,j,k,n,tot,ans,val,MASK;

int a[MAXN][MAXN],f[MAXN][MAXS],ST[MAXS];

char c;

int main()

{

    while (scanf("%d",&a[][]) != EOF)

    {

        n = ;

        tot = ans = ;

        memset(f,,sizeof(f));

        scanf("%c",&c);

        while (c != '\n')

        {

            scanf("%d",&a[][++n]);

            scanf("%c",&c);

        }

        for (i = ; i <= n; i++)

        {

            for (j = ; j <= n; j++)

            {

                scanf("%d",&a[i][j]);

            }

        }

        MASK = ( << n) - ;

        for (i = ; i <= MASK; i++)

        {

            if (i & (i << )) continue;

            ST[++tot] = i;

            for (j = ; j < n; j++)

            {

                if (i & ( << j))

                    f[][tot] += a[][j+];

            }

        }

        for (i = ; i <= n; i++)

        {

            for (j = ; j <= tot; j++)

            {

                val = ;

                for (k = ; k < n; k++)

                {

                    if (ST[j] & ( << k))

                        val += a[i][k+];

                }

                for (k = ; k <= tot; k++)

                {

                    if (ST[j] & ST[k]) continue;

                    if (ST[j] & (ST[k] >> )) continue;

                    if (ST[j] & (ST[k] << )) continue;

                    f[i][j] = max(f[i][j],f[i-][k] + val);

                }

            }

        }

        for (i = ; i <= n; i++)

        {

            for (j = ; j <= tot; j++)

            {

                ans = max(ans,f[i][j]);

            }

        }

        printf("%d\n",ans);

        scanf("%c",&c);

    }

    return ;

}