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;
typedef long double ld;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int mod=1e9+7;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int h;
    while(cin >> h){
        if(h==0){
            return 0;
        }
        vector<vector<int>> a(h,vector<int>(5));
        int sum=0;
        for(int i=h-1;i>=0;i--){
            for(int j=0;j<5;j++){
                cin >> a[i][j];
                sum+=a[i][j];
            }
        }
        bool f=true;
        while(f){
            f=false;
            for(int i=0;i<h;i++){
                int cnt=1;
                for(int j=0;j<5;j++){
                    if(j){
                        if(a[i][j]>0&&a[i][j]==a[i][j-1]){
                            cnt++;
                        }
                        else{
                            if(cnt>=3){
                                for(int k=j-cnt;k<j;k++){
                                    a[i][k]=0;
                                    f=true;
                                }
                            }
                            cnt=1;
                        }
                    }
                }
                if(cnt>=3){
                    for(int j=5-cnt;j<5;j++){
                        a[i][j]=0;
                        f=true;
                    }
                }
            }
            for(int x=0;x<10;x++){
                for(int i=1;i<h;i++){
                    for(int j=0;j<5;j++){
                        if(a[i-1][j]==0){
                            a[i-1][j]=a[i][j];
                            a[i][j]=0;
                        }
                    }
                }
            }
        }
        int res=0;
        for(int i=0;i<h;i++){
            for(int j=0;j<5;j++){
                res+=a[i][j];
            }
        }
        cout << sum-res << endl;
    }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define rep(x, y) for (int x=0; x<y; x++) 

void print(vector<vector<int> > board)
{
#if 0
	cerr << "------" << endl;
	rep(y, board.size()) {
		rep(x, board[y].size()) {
			if (board[y][x] != -1) 
				cerr << board[y][x] << " ";
			else cerr << "  ";
		}
		cerr << endl;
	}
	cerr << "------" << endl;
#endif
}

int main()
{
	int H;
	while (cin>>H, H) {
		vector<vector<int> > board(H, vector<int>(6));
		rep(i, H) rep(j, 5) cin >> board[i][j];
		rep(i, H) board[i][5] = -1;
		
		print(board);
		
		int ans=0;
		
		while (true) {
			// erase
			bool update = false;
			print(board);
			//cerr << "A" << endl;
			
			rep(y, H) {
				int cnt=1;
				for (int x=1; x<6; x++) {
					if (board[y][x] == board[y][x-1] && board[y][x] != -1) {
						cnt++;
					} else {
						if (cnt>=3) {
							for (int i=x-1; i>=x-cnt; i--) {
								ans += board[y][i];
								board[y][i] = -1;
							}
							update = true;
							cnt = 0;
						} else {
							cnt = 1;
						}
					}
				}
			}	
			
			//cerr << "B" << endl;
			
			// drop
			for (int y=H-2; y>=0; y--) {
				for (int x=0; x<5; x++) {
					int yy=y;
					while (yy<H-1 && board[yy+1][x] == -1) {
						swap(board[yy+1][x], board[yy][x]);
						yy++;
					}
				}
			}
			
			//cerr << "C" << endl;
		
			if (!update) break;
		}
		cout << ans << endl;
	}
}