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;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
    while (1) {
        int H;
        cin >> H;
        if (H == 0) break;
        int puzzle[H][5];
        rep(i, H) {
            rep(j, 5) cin >> puzzle[H - i - 1][j];
        }
        bool flag = true;
        int ans = 0;
        while (flag) {
            int step1 = 0;
            // step1
            rep(i, H) {
                int cnt = 0;
                int s = -1;
                rep(j, 4) {
                    if (puzzle[i][j] == puzzle[i][j + 1] && puzzle[i][j] != -1) cnt++;
                    else cnt = 0;
                    if (cnt >= 2) {
                        s = j - 1;
                        break;
                    }
                }
                if (s == -1) {
                    step1++;
                    continue;
                }
                int ct = puzzle[i][s];
                cnt = 0;
                repd(j, s, 5) {
                    if (ct != puzzle[i][j]) break;
                    puzzle[i][j] = -1;
                    cnt++;
                }
                ans += cnt * ct;
            }

            if (step1 == H) {
                flag = false;
                continue;
            }

            // step2
            bool step2 = true;
            while (step2) {
                step2 = false;
                repd(i, 1, H) {
                    rep(j, 5) {
                        if (puzzle[i][j] != -1 && puzzle[i - 1][j] == -1) {
                            puzzle[i - 1][j] = puzzle[i][j];
                            puzzle[i][j] = -1;
                            step2 = true;
                        }
                    }
                }
            }
        }

        cout << ans << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int map[20][5];
int h,ans;
void DFS(){
	bool move=false;
	for(int i=0;i<h;i++){
		int cnt=0,set=0;
		for(int j=0;j<5;j++){
			if(map[i][j]!=set){
				if(cnt>=3&&set!=0){
					for(int k=0;k<cnt;k++){
						ans+=map[i][j-k-1];
						map[i][j-k-1]=0;
					}
					move=true;
				}
				cnt=1;
				set=map[i][j];
			}
			else cnt++;
		}
		if(cnt>=3&&set!=0){
			for(int k=0;k<cnt;k++){
				ans+=map[i][4-k];
				map[i][4-k]=0;
			}
			move=true;
		}
	}
	for(int k=0;k<5;k++){
	for(int j=0;j<5;j++){
		for(int i=h-1;i>0;i--){
			if(map[i-1][j]==0){
				int tmp=map[i][j];
				map[i][j]=0;
				map[i-1][j]=tmp;
			}
		}
	}
	}
	if(move)DFS();
}
int main(){
	while(true){
	cin>>h;
	if(h==0)break;
	for(int i=0;i<h;i++){
		for(int j=0;j<5;j++){
			cin>>map[h-i-1][j];
		}
	}
	ans=0;
	DFS();
	cout<<ans<<endl;
	}
	return 0;
}