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 <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define All(v) (v).begin(),(v).end()
typedef long long ll;

int board[10][5];

int check(int y,int x){
    int nx=x,cnt=0;
    while(nx+1<5){
        if(board[y][nx]!=0&&board[y][nx]==board[y][nx+1])cnt++;
        else break;
        nx++;
    }
    return cnt+1;
}

int main(){
    int H;
    while(cin >> H,H){
        rep(i,H)rep(j,5)cin >> board[i][j];
        int point = 0;
        while(1){
            int breakflag=1;
            //消す
            for(int i=0;i<H;i++){
                for(int j=0;j<3;j++){
                    int c=0;
                    if((c=check(i,j))>=3){
                        breakflag=0;
                        for(int k=0;k<c;k++){
                            point+=board[i][j+k];
                            board[i][j+k]=0;
                        }
                    }
                }
            }
            if(breakflag)break;
            //落とす
            for(int t=0;t<11;t++){
                for(int i=H-1;i>=1;i--){
                    for(int j=0;j<5;j++){
                        if(board[i][j]==0){
                            swap(board[i-1][j],board[i][j]);
                        }
                    }   
                }
            }
        }
        cout << point << endl;
        rep(i,10)rep(j,5)board[i][j]=0;
    }
    return 0;
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#include<sstream>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define ALL(c) (c).begin(), (c).end()
#define dump(a) cerr << #a << "=" << (a) << endl
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class T> void chmin(T &t, T f) { if (t > f) t = f; } //t=min
template<class T> void chmax(T &t, T f) { if (t < f) t = f; } //t=max
using namespace std;


int N;
int puzzle[5][10];

int deletePuzzle()
{
	int get_p = 0;

	rep(y,N) {
		int back_p = 0;
		int hit_cnt = 1;
		int real_hit_cnt = 0;
		int the_p = 0;

		//一致している要素を見つける
		rep(x,5) {
			if (puzzle[x][y] == back_p) {
				hit_cnt++;
				if (hit_cnt >= 3) { //3回以上
					//if (N == 10) { dump(hit_cnt); }
					the_p = puzzle[x][y];
					real_hit_cnt = hit_cnt;
				}
			}
			else {
				hit_cnt = 1;
			}
			back_p = puzzle[x][y];
		}
		//if (N == 10) { dump(real_hit_cnt); }
		if (real_hit_cnt >= 3) { get_p += the_p * real_hit_cnt; } //ポイント換算

		//消去
		rep(x,5) {
			if (puzzle[x][y] == the_p) { puzzle[x][y] = 0; }
		}
	}

	return get_p;
}

void dropPuzzle()
{
	rep(x,5) {
		vector<int> real_ps;
		rep(y,N) {
			if (puzzle[x][y] > 0) { real_ps.push_back(puzzle[x][y]); } //点数を吸い取る
			puzzle[x][y] = 0; //全部一回削除
		}
		int the_N = real_ps.size();
		//dump(N-the_N);
		rep(y,the_N) { //the_N分たどる
			puzzle[x][y+(N-the_N)] = real_ps[y];
		}
	}
	
	/*
	//デバッグ
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	cout << endl;
	*/
}

int main()
{
	int all_p;
	while(true) {
		cin >> N;
		all_p = 0;

		if (N == 0) { break; }
		rep(y,N) {
			rep(x,5) {
				cin >> puzzle[x][y];
			}
		}

		//while get_p=0まで
		while(true) {
			int get_p = deletePuzzle();
			if (get_p == 0) { break; }
			all_p += get_p;
			dropPuzzle();
		}

		cout << all_p << endl;
	}
	return 0;
}

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

using namespace std;

int sum = 0;

void vanish(int h,int stone[10][6]) {
	for (int i = 1; i < h; ++i) {
		for (int j = 0; j < 5; ++j) {
			if (stone[i][j] == 0) {
				for (int k = 0; k < i; ++k) stone[i - k][j] = stone[i - (k + 1)][j];
				stone[0][j] = 0;
			}
		}
	}
}

void puzzle(int h,int stone[10][6]) {
	int num = 1, flag = 0;
	int w;
	for (int i = 0; i < h; ++i) {
		for (int j = 0; j < 5; ++j) {
			if (stone[i][j] == stone[i][j + 1] && stone[i][j] != 0) {
				if (num == 1) w = j;
				num++;
			} else if (num >= 3) {
				sum += num * (stone[i][w]);
				for (int k = 0; k < num; ++k) stone[i][w + k] = 0;
				num = 1;
				flag++;
			} else num = 1;
		}
	}
	if (flag != 0) {
		vanish(h, stone);
		puzzle(h, stone);
	}
}

int main() {
	int h;
	while (cin >> h && h != 0) {
		int stone[10][6] = {};
		for (int i = 0; i < h; ++i)
			for (int j = 0; j < 5; ++j)
				cin >> stone[i][j];
		puzzle(h, stone);

		cout << sum << endl;
		sum = 0;
	}

	return 0;
}