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<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-9;
const int inf=1e8;
int main(){
	int n;
	while(cin>>n,n){
		vvi in(5,vi(n));
		rep(i,n)rep(j,5)cin>>in[j][n-1-i];
		int out=0;
		while(1){
			bool h=false;
			rep(i,in[2].size()){
				int l=2,r=2;
				while(l>=0&&in[l].size()>=i&&in[l][i]==in[2][i])l--;
				while(r< 5&&in[r].size()>=i&&in[r][i]==in[2][i])r++;
				if(r-l-1<3)continue;
				out+=(r-l-1)*in[2][i];
				h=true;
				loop(j,l+1,r)in[j][i]=inf;
			}
			rep(i,5)rep(j,in[i].size())if(in[i][j]==inf){
				in[i].erase(in[i].begin()+j);
				j--;
			}
//		rep(i,5){rep(j,in[i].size())cout<<" "<<in[i][j];cout<<endl;}
			if(!h)break;
		}
		cout<<out<<endl;
	}
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>

using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
int ata[10];
int H;
int ima;
int input;
int flag;
int zu[5][10];
int ans;
int main()
{
	while(1)
	{
	cin>>H;if(H==0)break;
	rep(i,5)rep(j,10)zu[i][j]=0;
	ans=0;
	rep(i,H)
	{
		rep(j,5)
		{
			cin>>input;
			ans+=input;
			zu[j][H-i-1]=input;
		}
	}
	while(1)
	{
		flag=0;
		rep(i,H)
		{
			int t=zu[2][i];
			if(zu[2][i]!=0&&((zu[2][i]==zu[1][i]&&zu[0][i]==zu[1][i])||(zu[2][i]==zu[1][i]&&zu[2][i]==zu[3][i])||(zu[2][i]==zu[3][i]&&zu[2][i]==zu[4][i])))
			{
				flag=1;
				for(int j=1;j>=0;j--)
				{
					if(zu[j][i]==t)zu[j][i]=0;
					else break;
				}
				for(int j=3;j<5;j++)
				{
					if(zu[j][i]==t)zu[j][i]=0;
					else break;
				}
				zu[2][i]=0;
			}
		}
		rep(i,5)
		{
			rep(j,10)ata[j]=0;
			ima=0;
			rep(j,H)
			{
				if(zu[i][j]!=0)
				{
					ata[ima]=zu[i][j];
					ima++;
				}
			}
			rep(j,H)
			{
				zu[i][j]=ata[j];
			}
		}
		if(flag==0)break;
	}
	rep(i,5)
	{
		rep(j,10)
		{
			ans-=zu[i][j];
		}
	}
	cout<<ans<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

bool check (int d[10][5], int h) {
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < 5; j++) {
            int count = 1;
            while (j + 1 < 5 && d[i][j] == d[i][j + 1] && d[i][j] != 0) {
                j++;
                count++;
            }
            if (count >= 3) return true;
        }
    }
    return 0;
}

int main ()
{
    int h;
    while (cin >> h, h) {
        int d[10][5];
        for (int i = h - 1; i >= 0; i--) {
            for (int j = 0; j < 5; j++) {
                int t; cin >> t; d[i][j] = t;
            }
        }

        int res = 0;
        while (check(d, h)) {
            for (int i = 0; i < h; i++) {
                for (int j = 0; j < 5; j++ ) {
                    int count = 1;
                    while (j + 1 < 5 && d[i][j] == d[i][j + 1] && d[i][j] != 0) {
                        j++; count++;
                    }
                    if (count >= 3) {
                        res += count * d[i][j];
                        for (int k = j; count--; k--) {
                            d[i][k] = 0;
                        }
                    }
                }
            }

            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < h; j++) {
                    if (d[j][i] == 0) {
                        int n = 0;
                        for (int k = j; k < h; k++) {
                            if (d[k][i] != 0) n++;
                            if (k < h - 1) {
                                d[k][i] = d[k + 1][i];
                            } else {
                                d[k][i] = 0;
                            }
                        }
                        if (n > 0) j--;
                    }
                }
            }
        }
        cout << res << endl;
    }

    return 0;
}