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>

using namespace std;

#define ISEQUAL(i,a,b,c) Data[a][i] == Data[b][i] && Data[b][i] == Data[c][i] && Data[a][i] != 0

int main(){
	int RowNum = 0;//行数
	int* Data[5];//数値データ[列][行]
	int Points = 0;//ポイント
	bool IsComprete = false;//ルーチン終了判定用
	bool Checker[5] = { false };//行ごと消去判定用
	bool IsFall = true;//落下判定
	int FirstZeroPos = 0;//落下判定時ゼロ位置保持用

	while(1){
		cin >> RowNum;
		if (RowNum == 0)break;
		//データ代入
		for (int i = 0; i < 5; ++i){
			Data[i] = new int[RowNum];
		}
		for (int i = 0; i < RowNum; ++i){
			for (int j = 0; j < 5; ++j){
				cin >> Data[j][i];
			}
		}

		Points = 0;

		//ゲームルーチン
		while (!IsComprete){
			IsComprete = true;
			for (int i = 0; i < RowNum; ++i){//上から行ごとに
				for (int j = 0; j < 5; ++j){//判定用変数初期化
					Checker[j] = false;
				}
				for (int j = 0; j < 3; ++j){//消滅判定
					if (ISEQUAL(i, j, j + 1, j + 2)){
						Checker[j] = true; Checker[j + 1] = true;
						Checker[j + 2] = true;
						IsComprete = false;//消滅判定時未終了と判断
					}
				}
				for (int j = 0; j < 5; ++j){//消滅処理
					if (Checker[j]){
						Points += Data[j][i];
						Data[j][i] = 0;
					}
				}
			}
			//落下処理
			for (int j = 0; j < 5; ++j){//列ごとに
				IsFall = true;
				while (IsFall){
					FirstZeroPos = -1; IsFall = false;
					for (int i = RowNum - 1; i >= 0; --i){//下から
						if (FirstZeroPos == -1){
							if (Data[j][i] == 0)FirstZeroPos = i;
						} else {
							if (Data[j][i] != 0){
								Data[j][FirstZeroPos] = Data[j][i];
								Data[j][i] = 0;
								IsFall = true;
								break;
							}
						}
					}
				}
			}
		}

		cout << Points << endl;

		for (int i = 0; i < 5; ++i){
			delete[] Data[i];
		}

	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef long long int ll;

#define EPS (1e-7)
#define INF (1e9)
#define LLINF (1e18)
#define PI (acos(-1))
#define MOD (1000000007)
#define ALL(v) (v).begin(), (v).end()
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

//-------------------------------------
const int w = 5;

void printBoard(vector<vector<int>> &board, int h)
{
    cout << "---------------------------" << endl;
    for (int i = 0; i < h; i++)
    {
        for (int j = 0; j < w; j++)
        {
            cout << board[i][j] << ' ';
        }
        cout << endl;
    }
    cout << "----------------------------" << endl;
}

int del(vector<vector<int>> &board, int h)
{
    // 消えたところは一旦-1にする
    int res = 0;
    for (int y = 0; y < h; y++)
    {
        for (int x = 0; x < w - 2; x++)
        {
            if (board[y][x] == -1)
            {
                continue;
            }

            int right = x;
            while (right + 1 < w && board[y][right + 1] == board[y][right])
            {
                right++;
            }
            if (right - x + 1 >= 3)
            {
                for (int i = x; i <= right; i++)
                {
                    res += board[y][i];
                    board[y][i] = -1;
                }
                x = right;
            }
        }
    }
    // 消したところを整列

    for (int x = 0; x < w; x++)
    {
        vector<pair<int, int>> rec(h); // fi:元何番目か se:値
        vector<int> rec2(h);           // 石の値を一旦保存
        int cnt = 0;
        for (int y = 0; y < h; y++)
        {
            rec[y].first = y;
            if (board[y][x] == -1)
            {
                rec[y].second = -INF;
            }
            else
            {
                rec[y].second = cnt;
                cnt++;
            }
        }
        sort(ALL(rec), [](const auto &a, const auto &b) { return a.second < b.second; });
        for (int i = 0; i < h; i++)
        {
            rec2[i] = board[i][x];
        }
        for (int i = 0; i < h; i++)
        {
            board[i][x] = rec2[rec[i].first];
        }
    }

    return res;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int h;
    while (1)
    {
        cin >> h;
        if (h == 0)
        {
            break;
        }
        vector<vector<int>> board(h, vector<int>(w, 0));
        // cout << "dbg:" << h << endl;
        // cout << "dbg :" << endl;
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                cin >> board[i][j];
            }
        }
        // printBoard(board, h);
        int ans = 0;
        bool flg = true;
        while (flg)
        {
            int tmpp = del(board, h);
            ans += tmpp;
            if (tmpp == 0)
            {
                flg = false;
            }
        }
        // cout << "ans:";
        cout << ans << endl;
    }
    return 0;
}