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<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
const int mod = 1e9 + 7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}

int main() {
    int n;
    while (cin >> n && n) {
        vector<int> v[5];
        rep(i, n) rep(j, 5) {int p; cin >> p; v[j].push_back(p);}
        int flg = 0;
        int sum = 0;
        //cout << endl; rep(i, n) {rep(j, 5) cout << v[j][i] << " "; cout << endl;}
        while (1) {
            flg = 0;
            rep(i, n) { //まず全部の0
                rrep(j, 1, 5) { //start point
                    //cout << i << " " << j << endl;
                    if (v[j][i] == 0) continue;
                    int c = 1;
                    int k = j;
                    vector<int> vv;
                    vv.push_back(k - 1);
                    while (v[k][i] == v[k - 1][i]) {c++; vv.push_back(k); k++; if (k == 5) break;}
                    //cout << c << endl;
                    if (c >= 3) {
                        flg = 1;
                        sum += v[j][i] * c;
                        //cout << v[j][i] << " " << c << endl;
                        rep(l, vv.size()) {
                            v[vv[l]][i] = 0;
                        }
                    }
                }
            }
            if (n == 1) {cout << sum << endl; flg = 0; break;}
            //cout << endl; rep(i, n) {rep(j, 5) cout << v[j][i] << " "; cout << endl;}
            //slide phase
            rep(i, n) {
                rep(j, 5) {
                    if (v[j][i] == 0) {
                        for (int k = i; k >= 1; k--) {
                            v[j][k] = v[j][k - 1];
                        }
                        v[j][0] = 0;
                    }
                }
            }
            //cout << endl; rep(i, n) {rep(j, 5) cout << v[j][i] << " "; cout << endl;}
            if (flg == 0) break;
        }
        if (n != 1) cout << sum << endl;
    }
}

C++: #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;


int field[10][6];
int height[5];
int H;


int del(){
	int score=0;
	rep(y,H){
		int seq=0;
		int prev=0;
		rep(x,6){
			if(prev==field[y][x]){
				seq++;
			}else{
				if(3<=seq){
					for(int i=1;i<=seq;i++){
						score+=field[y][x-i];
						field[y][x-i]=0;
					}
				}
				seq=1;
				prev=field[y][x];
			}
		}
	}
	return score;
}
void fall(){
	memset(height,0,sizeof(height));
	rep(y,H){
		rep(x,5){
			if(field[y][x]==0)continue;
			if(y!=height[x]){
				field[height[x]][x]=field[y][x];
				field[y][x]=0;
			}
			height[x]++;
		}
	}
}


int main(){
	while(cin>>H&&H){
		for(int y=H-1;y>=0;y--)
			for(int x=0;x<5;x++)cin>>field[y][x];
		int ans=0,t;

		while(t=del()){
			ans+=t;
			fall();
		}
		cout<<ans<<endl;
	}

	return 0;
}