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 main(){
while(1){
 int H;
 cin>>H;

 if(H==0)break;

 int S[10][5];
 for(int y=0;y<H;y++)
	for(int x=0;x<5;x++)
		cin>>S[y][x];

 int sco=0;
 
 while(1){
	bool flg=false;

	for(int y=0;y<H;y++){
		int m =S[y][2];//真ん中覚える
		if(m==0)
			continue;

		if(S[y][0]==m && S[y][1]==m){//012で消える
			sco+=m*3;
			S[y][0]=S[y][1]=S[y][2]=0;
			flg==true;
			if(S[y][3]==m){
				sco+=m;
				S[y][3]=0;
				if(S[y][4]==m){
					sco+=m;
					S[y][4]=0;
				}
			}
		}
		else if(S[y][1]==m&&S[y][3]==m){
			sco+=m*3;
			S[y][1]=S[y][2]=S[y][3]=0;
			flg=true;
			if(S[y][4]==m){
				sco+=m;
				S[y][4]=0;
			}
		}
		else if(S[y][3]==m&&S[y][4]==m){
			sco+=m*3;
			S[y][2]=S[y][3]=S[y][4]=0;
			flg=true;
		}
	}
	if(!flg)break;

	for(int x=0;x<5;x++){
		for(int y=H-1;y>=0;y--){
			if(S[y][x]!=0)
				continue;
			for(int y2=y-1;y2>=0;y2--){
				if(S[y2][x]!=0){
					S[y][x]=S[y2][x]=0;
					S[y2][x]=0;
					break;
				}
			}
		}
	}
 }
 cout<<sco<<endl;
}
return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int h;
	while (cin >> h, h) {
		vvi cell(h, vi(5));
		int sum = 0;
		REP(i, h)
			REP(j, 5) {
			cin >> cell[i][j];
			sum += cell[i][j];
		}
		bool change;
		do {
			change = false;
			REP(i, h) {
				int a = -1;
				int cnt = 1;
				REP(j, 5) {
					if (cell[i][j] == a) {
						cnt++;
					}
					else {
						cnt = 1;
					}
					a = cell[i][j];
					if (cnt >= 3 && a != 0)
						FOR(k, j - cnt + 1, j + 1) {
						cell[i][k] = 0;
						change = true;
					}

				}
			}
			REP(k,h){
			for (int i = h - 1;i > 0;i--) {
				REP(j, 5)
					if (cell[i][j] == 0) {
						cell[i][j] = cell[i - 1][j];
						cell[i - 1][j] = 0;
					}
			}
		}
		 } while (change);
		 
		 REP(i, h)
			 REP(j, 5)
			 sum -= cell[i][j];
		 cout << sum << endl;
	}
}

C++: #include<iostream>
using namespace std;
int h,a[11][5];
main()
{
	while(cin>>h,h)
	{
		for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>a[i][j];
		int ans=0;
		bool flag=1;
		while(flag)
		{
			flag=0;
			for(int i=0;i<h;i++)
			{
				for(int j=0;j<3;j++)
				{
					if(a[i][j]&&a[i][j]==a[i][j+1]&&a[i][j]==a[i][j+2])
					{
						ans+=a[i][j]*3;
						flag=1;
						if(j+3<5&&a[i][j]==a[i][j+3])
						{
							ans+=a[i][j],a[i][j+3]=0;
							if(j+4<5&&a[i][j]==a[i][j+4])ans+=a[i][j],a[i][j+4]=0;
						}
						a[i][j]=a[i][j+1]=a[i][j+2]=0;
					}
				}
			}
			for(int j=0;j<5;j++)
			{
				for(int i=h;i-->0;)
				{
					if(a[i][j]==0)
					{
						int k;
						for(k=i-1;k>=0&&a[k][j]==0;k--);
						if(k<0)break;
						a[i][j]=a[k][j];
						a[k][j]=0;
					}
				}
			}
		}
		cout<<ans<<endl;
	}
}