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;
int h;
int field[15][5];
int changed[15][5];
int main(){
	while(1){
		cin >> h;
		if(h==0)break;
		int ans=0;
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				cin >> field[i][j];
			}
		}
		while(1){
			bool ok=true;
			for(int i=0;i<h;i++){
				for(int j=0;j<3;j++){//起点として見るのは3番目までで良い
					if(field[i][j]==field[i][j+1]&&field[i][j]>0){
						int cnt=0;
						int copy=field[i][j];
						while(copy==field[i][j]&&j<5){
							cnt++;
							j++;
						}
						if(cnt>2){
							j-=cnt;
							for(int k=j;k<5;k++){
								if(copy==field[i][k]){
									changed[i][k]=1;
								}
								else break;
							}
							j+=cnt;
						}
						j--;
					}
				}
			}
			for(int i=0;i<h;i++){
				for(int j=0;j<5;j++){
					if(changed[i][j]==1){
						ok=false;
						ans+=field[i][j];
						for(int k=i;k>0;k--){
							field[k][j]=(field[k-1][j]>0?field[k-1][j]:0);
						}
						field[0][j]=0;
					}
				}
			}
			for(int i=0;i<h;i++){
				for(int j=0;j<5;j++){
					changed[i][j]=0;
				}
			}
			if(ok)break;
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL

int main() {
	for (int H; cin >> H&&H;) {
		int A[10][5] = {};
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> A[i][j];
			}
		}

		int ans = 0;

		for (bool flag = true; flag;) {//??????????????£???????????????
			flag = false;
			for (int i = 0; i < H; i++) {
				int F = 0, E = 1;
				for (int j = 1; j < 5 + 1; j++) {
					if (A[i][j] != A[i][j - 1]) {
						if (E - F >= 3) {
							flag = true;
							ans += A[i][j - 1] * (E - F);
							for (int f = F; f < E; f++) {
								A[i][f] = 0;
							}
							break;
						}
						F = j;
						E = j + 1;
					}
					else if (A[i][j - 1] != 0) {
						E++;
					}
					//cout << F << E << endl;
				}
			}

			//cout << "before" << endl;
			//for (int i = 0; i < H; i++) {
			//	for (int j = 0; j < 5; j++) {
			//		cout << A[i][j] << " ";
			//	}
			//	cout << endl;
			//}

			for (bool flag2 = true; flag2;) {
				flag2 = false;
				for (int i = H - 1; i > 0; i--) { //i!=0
					for (int j = 0; j < 5; j++) {
						//?¶???????????????????
						if (A[i][j] == 0) {
							if (A[i - 1][j] |= 0)flag2 = true;
							swap(A[i][j], A[i - 1][j]);
						}
					}
				}
			}

			//cout << "after" << endl;
			//for (int i = 0; i < H; i++) {
			//	for (int j = 0; j < 5; j++) {
			//		cout << A[i][j] << " ";
			//	}
			//	cout << endl;
			//}
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<vi> vvi;

int main()
{
    int h;
    while(cin >>h,h)
    {
        vvi f(h,vi(5));
        for(int i=h-1; i>=0; --i)rep(j,5) cin >>f[i][j];

        int ans=0;
        int l[6]={0,0,1,0,1,2};
        int r[6]={4,3,4,2,3,4};

        while(1)
        {
            int del=0;

            //delete
            rep(i,h)
            {
                rep(j,6)
                {
                    int num=f[i][l[j]];
                    if(num==0) continue;

                    bool valid=true;
                    for(int k=l[j]+1; k<=r[j]; ++k)
                    {
                        if(f[i][k]!=num) valid=false;
                    }

                    if(valid)
                    {
                        ans+=num*(r[j]-l[j]+1);
                        for(int k=l[j]; k<=r[j]; ++k)
                            f[i][k]=0;
                        ++del;
                    }
                }
            }

            if(!del) break;

            //fall
            rep(i,5)
            {
                //i-th column
                rep(j,h)
                {
                    bool all0=true;
                    for(int k=j; k<h; ++k)
                    {
                        if(f[k][i]!=0) all0=false;
                    }
                    if(all0) continue;

                    //printf("i,j %d,%d\n", i,j);
                    if(f[j][i]==0)
                    {
                        for(int k=j+1; k<h; ++k)
                            f[k-1][i]=f[k][i];
                        f[h-1][i]=0;
                        --j;
                    }
                }
            }

        }

        printf("%d\n",ans);
    }
    return 0;
}