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 <string>
#include <vector>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <math.h>
#include <complex>
using ll = long long;
using namespace std;

#define rep(i, n) for (int i = 0; i < (n); i++)
int const MOD = 1e9 + 7;

using ci = pair<char, int>; //文字 深さ
using ii = pair<int, int>;  //数字 深さ

int main(void)
{
    int H;
    while (cin >> H, H)
    {
        int field[100][100];
        rep(i, 100) rep(j, 100) field[i][j] = 0;
        for (int i = 0; i < H; ++i)
        {
            for (int j = 0; j < 5; ++j)
            {
                cin >> field[i][j];
            }
        }

        int ans = 0;
        bool ok = true;
        while (ok)
        {
            ok = false;

            for (int i = 0; i < H; ++i)
            {
                int j = 0, cnt = 0;
                while (j != 5)
                {
                    if (field[i][j] == 0)
                    {
                        j++;
                        continue;
                    }
                    if (field[i][j] == field[i][j + 1] && j < 4)
                    {
                        cnt++;
                    }
                    else if (field[i][j] != field[i][j + 1] || j == 4)
                    {
                        cnt++;
                        if (cnt >= 3)
                        {
                            ans += cnt * field[i][j];
                            for (int k = cnt - 1; k >= 0; --k)
                            {
                                field[i][j - k] = 0;
                            }
                            ok = true;
                        }
                        cnt = 0;
                    }
                    j++;
                }
            }
            bool check = true;
            while (check)
            {
                check = false;
                for (int i = H - 1; i >= 1; --i)
                {
                    for (int j = 0; j < 5; ++j)
                    {
                        if (field[i][j] == 0 && field[i - 1][j] != 0)
                        {
                            swap(field[i][j], field[i - 1][j]);
                            check = true;
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }

    return 0;
}

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

using namespace std;

#define HMAX 10
#define WMAX 5

int main(){

	int H,W;
	int ban[HMAX][WMAX];

	while(1){

		int sum1=0;
		cin>>H;
		if(H==0) break;
		W=5;

		for(int i=0;i<H;i++){
			for(int j=0;j<W;j++){
				cin>>ban[i][j];
				sum1+=ban[i][j];
			}
		}

		while(1){
			bool ff=false;
			for(int i=0;i<H;i++){
				for(int j=0;j<W;j++){
					for(int l=W;l>=3;l--){
						bool f=true;
						int base=ban[i][j];
						if(ban[i][j]==-1) f=false;
						for(int k=0;k<l;k++){
							if(j+k>=W) f=false;
							else if(ban[i][j+k]!=base) f=false;
						}
						if(f){
							for(int k=0;k<l;k++){
								ban[i][j+k]=-1;
							}
							ff=true;
						}
					}
				}
			}
			while(1){
				bool f=false;
				for(int i=1;i<H;i++){
					for(int j=0;j<W;j++){
						if(ban[i][j]==-1&&ban[i-1][j]!=-1){
							swap(ban[i][j],ban[i-1][j]);
							f=true;
							ff=true;
						}
					}
				}
				if(!f) break;
			}
			if(!ff) break;
		}

		int sum2=0;
		for(int i=0;i<H;i++){
			for(int j=0;j<W;j++){
				if(ban[i][j]!=-1) sum2+=ban[i][j];
			}
		}

		cout<<sum1-sum2<<endl;
	}
}