#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ppb pop_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<vb> vvb;

class DengklekMakingChains
{
public:
    int maxBeauty(vector <string>);
};

bool check(string &s)
{
    for (int i = 0; i < sz(s); i++)
        if (s[i] == '.') return 0;
    return 1;
}

bool checkstart(string &s)
{
    if (s[0] == '.' && s[sz(s)-1] != '.') return 1;
    return 0;
}

bool checkend(string &s)
{
    if (s[0] != '.' && s[sz(s)-1] == '.') return 1;
    return 0;
}

bool checkstartend(string &s)
{
    if (s[0] == '.' && s[sz(s)-1] == '.') return 1;
    return 0;
}

int DengklekMakingChains::maxBeauty(vector <string> chains)
{
    vector<string> s, start, end, startend;
    for (int i = 0; i < sz(chains); i++)
        if (check(chains[i]))
        {
            s.pb(chains[i]);
        } else if (checkstartend(chains[i]))
        {
            startend.pb(chains[i]);
        } else if (checkstart(chains[i]))
        {
            start.pb(chains[i]);
        } else if (checkend(chains[i]))
        {
            end.pb(chains[i]);
        }

    int ans = 0;
    if (sz(s) > 0)
    {
        int sum = 0;
        for (int i = 0; i < sz(s); i++)
            for (int j = 0; j < sz(s[i]); j++)
                sum += (int)(s[i][j]-'0');
        int sumstart = 0;
        for (int i = 0; i < sz(start); i++)
        {
            int tmp = 0;
            for (int j = 0; i < sz(start[i]); j++)
                if (start[i][j] != '.') tmp += (int)(start[i][j]-'0');
            sumstart = max(sumstart, tmp);
        }
        int sumend = 0;
        for (int i = 0; i < sz(end); i++)
        {
            int tmp = 0;
            for (int j = 0; i < sz(end[i]); j++)
                if (end[i][j] != '.') tmp += (int)(end[i][j]-'0');
            sumend = max(sumend, tmp);
        }
        ans = sum + sumstart + sumend;
    } else
    {
        int sumstartend = 0;
        for (int i = 0; i < sz(startend); i++)
        {
            int tmp = 0;
            for (int j = 0; i < sz(startend[i]); j++)
                if (startend[i][j] != '.') tmp += (int)(startend[i][j]-'0');
            sumstartend = max(sumstartend, tmp);
        }
        int sumstart = 0;
        int sumend = 0;
        for (int i = 0; i < sz(start); i++)
        {
            int tmp = 0;
            for (int j = 0; i < sz(start[i]); j++)
                if (start[i][j] != '.') tmp += (int)(start[i][j]-'0');
            sumstart = max(sumstart, tmp);
        }
        for (int i = 0; i < sz(end); i++)
        {
            int tmp = 0;
            for (int j = 0; i < sz(end[i]); j++)
                if (end[i][j] != '.') tmp += (int)(end[i][j]-'0');
            sumend = max(sumend, tmp);
        }
        ans = max(sumstartend, sumstart+sumend);
    }
    return ans;
}

<%:testing-code%>
//Powered by [KawigiEdit] 2.0!