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

// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// ???
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// ?????°
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion

#define int long long

int field[11][6];
int h;

int check() {
    int row = 0;
    int col = 0;
    int len = 0;
    int score = 0;
    for(row=0; row<h; ++row) {
        for(col=0; col<=2; ++col) {
            for(len=1; col+len<=4; ++len) {
                if(field[row][col]!=field[row][col+len]) break;
            }
            if(len<=2) continue;
            score += field[row][col]*len;
            for(int i=0; i<len; ++i) field[row][col+i] = 0;
        }
    }

    return score;
}

void down() {
    int mn = INF;
    for(int col=0; col<5; ++col) {
        for(int mn=1; mn<h; ++mn) {
            for(int row=h-1; row>=mn; --row) {
                if(field[row][col]==0) {
                    field[row][col] = field[row-1][col];
                    field[row-1][col] = 0;
                }
            }
        }
    }
}

signed main()
{
    while(cin>>h, h) {
        for(int i=0; i<h; ++i) {
            for(int j=0; j<5; ++j)
                cin >> field[i][j];
        }

        int score = 0;
        int cs = 0;
        while(true) {
            cs = check();
            if(cs==0) {
                cout << score << endl;
                break;
            }
            score += cs;
            down();
        }
    }
    return 0;
}

Measured memory_bytes: 3052