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<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;


using namespace std;

int MAP[10][5];
int h;
void fall(){
	rep(i,h){
		for(int i=h-1;i>0;i--) rep(j,5){
			if(MAP[i][j]==-1){
				MAP[i][j]=MAP[i-1][j];
				MAP[i-1][j]=-1;
			}
		}
	}
}

int search(int x,int y,int num,int count){

	if(x<0||y<0||x>=5) return count;
	if(MAP[y][x]==-1||MAP[y][x]!=num) return count;


	int ans = 0;
	count++;
	count = search(x+1,y,num,count);

	if(count>=3) MAP[y][x]=-1;

	return count;
}

int main(){

	while(1){
		cin >> h;

		if(h==0) break;

		int ans=0;
		int p_score=-1;
		memset(MAP,-1,sizeof(MAP));
		rep(i,h) rep(j,5) cin >> MAP[i][j];


		while(1){
			rep(i,h) rep(j,5){
				int point = MAP[i][j];  
				int combo = search(j,i,MAP[i][j],0);
				if(combo>=3){
					cout << combo << " " << point << endl;
					ans+=combo*point;
				}
			}

			fall();

			if(p_score==ans) break;
			p_score=ans;
		}
		cout << ans << endl;
	}

}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int map[20][5];
int h,ans;
void DFS(){
	bool move=false;
	for(int i=0;i<h;i++){
		int cnt=0,set=0;
		for(int j=0;j<5;j++){
			if(map[i][j]!=set){
				if(cnt>=3&&set!=0){
					for(int k=0;k<cnt;k++){
						ans+=map[i][j-k-1];
						map[i][j-k-1]=0;
					}
					cout<<"$"<<set<<" "<<cnt<<endl;
					move=true;
				}
				cnt=1;
				set=map[i][j];
			}
			else cnt++;
		}
		if(cnt>=3&&set!=0){
			for(int k=0;k<cnt;k++){
				ans+=map[i][4-k];
				map[i][4-k]=0;
			}
			move=true;
		}
	}
	for(int k=0;k<5;k++){
	for(int j=0;j<5;j++){
		for(int i=h-1;i>0;i--){
			if(map[i-1][j]==0){
				int tmp=map[i][j];
				map[i][j]=0;
				map[i-1][j]=tmp;
			}
		}
	}
	}
	if(move)DFS();
}
int main(){
	while(true){
	cin>>h;
	if(h==0)break;
	for(int i=0;i<h;i++){
		for(int j=0;j<5;j++){
			cin>>map[h-i-1][j];
		}
	}
	ans=0;
	DFS();
	cout<<ans<<endl;
	}
	return 0;
}

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

#define REP(i,n) for(int i=(0); i<n; ++i)

double eps = 1e-10;
const int INF = 1e+9;
typedef pair<int, int> P;
typedef pair<int, P> pp;
const int MAX_N = 105000;

int H;
int maze[16][8];

int search(int x, int y, int c){
	int cnt = 0;
	while(1){
		if(maze[y][x] != c)
			break;
		x += 1;
		cnt++;
	}
	if(cnt >= 3)
		return cnt;
	else
		return 0;
}

int main() {
	while(cin >> H && H){
		for(int i = 0; i < 16; ++i)
			for(int j = 0; j < 5; ++j)
				maze[i][j] = 0;
		for(int i = 0; i < H; ++i)
			for(int j = 0; j < 5; ++j)
				scanf("%d", &maze[i][j]);
				
		int ans = 0;
		vector<pp> vec;
		while(1){
			for(int y = 0; y < H; ++y){
				int cnt;
				for(int x = 0; x < 3; ++x){
					if(maze[y][x] == 0)	
						continue;
					if(cnt = search(x, y, maze[y][x])){
						ans += maze[y][x] * cnt;
						for(int i = x; i < x + cnt; ++i){
							maze[y][i] = 0;
						}
						vec.push_back(pp(y, P(x, x + cnt)));
						break;
					}
				}
			}
			if(vec.empty())
				break;
			sort(vec.begin(), vec.end());
			for(int i = 0; i < vec.size(); ++i){
				for(int y = vec[i].first; y > 0; --y){
					for(int x = vec[i].second.first; x < vec[i].second.second; ++x){
						maze[y][x] = maze[y - 1][x];
					}
				}
			}
			vec.clear();
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int64_t i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)

int n,a[11][5];

void solve()
{
    while(cin>>n,n){
        REP(i,n)REP(j,5)cin>>a[i][j];
        int ans=0;bool flag=1;
        while(flag){
            flag=0;
            REP(i,n){
                int now=a[i][0],cnt=1,idx=0;
                rep(j,1,5){
                    if(a[i][j]==a[i][j-1])cnt++;
                    else if(cnt<3)now=a[i][j],cnt=1,idx=j;
                    else break;
                }
                if(cnt>=3&&a[i][idx]!=0){
                    ans+=cnt*a[i][idx];
                    flag=1;
                    rep(j,idx,idx+cnt)a[i][j]=0;
                }
            }
            REP(i,5)REP(j,n)if(a[j][i]==0){
                for(int k=j;k>0;k--)swap(a[k][i],a[k-1][i]);
            } 
        }
        cout<<ans<<endl;
    }
}

int main() 
{
    cin.tie(0);
	ios::sync_with_stdio(false);
    solve();
    return 0;
}