Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		h := io.NextInt()
		if h == 0 {
			break
		}
		p := make([][]int, h)
		for i := 0; i < h; i++ {
			p[i] = make([]int, 5)
			for j := 0; j < 5; j++ {
				p[i][j] = io.NextInt()
			}
		}
		ans := 0
		for {
			sc := puyo(p, h)
			if sc == 0 {
				break
			}
			fall(p, h)
			ans += sc
		}
		io.Println(ans)
	}
}

func puyo(p [][]int, h int) int {
	sc := 0
	for i := 0; i < h; i++ {
		for j := 0; j < 3; j++ {
			var cnt int
			for cnt = 1; j+cnt < 5; cnt++ {
				if p[i][j] != p[i][j+cnt] {
					break
				}
			}
			if cnt > 2 {
				sc += p[i][j]*cnt
				for k := 0; k < cnt; k++ {
					p[i][j+k] = 0
				}
			}
		}
	}
	return sc
}

func fall(p [][]int, h int) {
	for j := 0; j < 5; j++ {
		for k := 1; k < h; k++ {
			for i := h - 1; i >= k; i-- {
				if p[i][j] == 0 {
					p[i][j] = p[i-1][j]
					p[i-1][j] = 0
				}
			}
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second

ll h;
vector<ll> v[5];

int main(){
	while (cin >> h&&h){
		ll ans = 0;
		REP(i, 5){
			v[i].clear();
			v[i].resize(h);
		}
		REP(i, h){
			REP(j, 5){
				cin >> v[j][h - 1 - i];
			}
		}
		bool f = 1;
		while (f){
			//REP(i, 5){
			//	REP(j, v[i].size()){
			//		cout << v[i][j] << "  ";
			//	}
			//	cout << endl;
			//}
			f = 0;
			vector<pair<P, ll>> vpi;
			REP(i, h){
				ll cnt = 1, pos = 0;
				REP(j, 5 - 1){
					if (v[j][i] == v[j + 1][i]){
						cnt++;
					}
					else{
						if (cnt >= 3){
							vpi.push_back({ P(pos, cnt), i });
						}
						pos = j + 1;
						cnt = 1;
					}
				}
				if (cnt >= 3){
					vpi.push_back({ P(pos, cnt), i });
				}
			}
			REP(i, vpi.size()){
				ll he = vpi[i].second, pos = vpi[i].first.first, cnt = vpi[i].first.second;
				ans += (v[pos][he] * cnt);
				REP(j, cnt)v[pos + j][he] = -1;
			}
			REP(i, 5){
				if (v[i].size() == 1){
					if (v[i][0] == -1)v[i].pop_back();
				}
				else {
					auto it = v[i].begin();
					while (it != v[i].end()){
						if (*it == -1){
							f = 1;
							it = v[i].erase(it);
						}
						else it++;
					}
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define reps(i,j,k) for(int i=j;i<k;++i)
#define rep(i,j) reps(i,0,j)
int stage[12][12];
int W,H;
int check(){
	int prev = -1;
	int cnt = 0;
	int res = 0;
	rep(i,H){
		rep(j,W){
			if(prev != stage[i][j] || prev == 0){
				if(cnt >= 3){
					res += stage[i][j-1]*cnt;
					reps(k,j-cnt,j){
						stage[i][k] = 0;
					}
				}
				prev = stage[i][j];
				cnt = 1;
			}
			else{
				cnt++;
			}
		}
		if(cnt >= 3){
			res += stage[i][W-1]*cnt;
			reps(k,W-cnt,W){
				stage[i][k] = 0;
			}
		}
		cnt = 0;
		prev = -1;
	}
	return res;
}

void drop(){
	rep(i,H-1){
		rep(j,W){
			int c = 0;
			while(stage[i][j] == 0){
				if(c == H)break;
				reps(k,i+1,H){
					stage[k-1][j] = stage[k][j];
				}
				c++;
			}
		}
	}
}

int main(){
	W = 5;

	while(scanf("%d",&H),H){
	
		rep(i,H){
			rep(j,W){
				scanf("%d",&stage[H-i-1][j]);
			}
		}
		int score = 0;
		while(true){
			int tmp = check();
			if(tmp == 0)break;
			score += tmp;
			drop();
		}	
		printf("%d\n",score);
	}
	return 0;
}

C++: #define NDEBUG 1

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cassert>

using namespace std;

#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)

typedef long long ll;

int main(){
    int n;
    while(cin >> n && n){
        vector<vector<int>> g(5,vector<int>(n));
        rep(i,n)rep(j,5) cin >> g[j][i];
        rep(i,5) reverse(begin(g[i]), end(g[i]));
        // rep(i,5)rep(j,5) cin >> g[i][j];
        // rep(i,5) reverse(begin(g[i]), end(g[i]));
        // rep(i,5)rep(j,i) swap(g[i][j], g[j][i]);
        int ans = 0, add = -1;
        while(add){
            add = 0;
            rep(i,5){
                rep(j,g[i].size()){
                    int ni = i;
                    if(g[i][j] == -1) continue;
                    while(ni < 5 && j < (int)g[ni].size() && g[ni][j]==g[i][j]) ni++;
                    if(ni - i < 3) continue;
                    add += g[i][j] * (ni-i);
                    // printf(" %d %d %d\n", j,i,ni);
                    loop(k,i,ni) g[k][j] = -1;
                }
            }
            for(auto & r:g) r.erase(remove(begin(r), end(r),-1), r.end());
            ans += add;
            assert(add > 0);
        }
        cout << ans << endl;
    }
}