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>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define RFOR(i,k,n) for (int (i)=(n)-1;(i)>=(k);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FOR(i,0,n)
#define pb push_back
using namespace std;

int clearnum;

int scoreplus(int *a, int b, int e){
    int scoreplus = 0;
    REP(i,e-b+1){
        scoreplus += *(a + b + i);
    }
    return scoreplus;
}

void clear(int *a,int b,int e){
    REP(i,e-b+1){
        *(a + b + i) = 0;
    }
    clearnum++;
}

int main(){
    int h;
    while(cin >> h && h > 0){
        int a[h][5], score = 0;
        REP(i,h){
            REP(j,5){
                cin >> a[i][j];
            }
        }
        while(1){
            clearnum = 0;
            REP(i,h){
                if(a[i][0] > 0 && a[i][0] == a[i][1] && a[i][0] == a[i][2]){
                    if(a[i][0] == a[i][3]){
                        if(a[i][0] == a[i][4]){
                           score += scoreplus(a[i],0,4);
                            clear(a[i],0,4);
                        }
                        else{
                            score += scoreplus(a[i],0,3);
                            clear(a[i],0,3);
                        }
                    }
                    else{
                        score += scoreplus(a[i],0,2);
                        clear(a[i],0,2);
                    }
                }
                else if(a[i][1] > 0  && a[i][1] == a[i][2] && a[i][1] == a[i][3]){
                    if(a[i][1] == a[i][4]){
                        score += scoreplus(a[i],1,4);
                        clear(a[i],1,4);
                    }
                    else{
                        score += scoreplus(a[i],1,3);
                        clear(a[i],1,3);
                    }
                }
                else if(a[i][2] > 0 && a[i][2] == a[i][3] && a[i][2] == a[i][4]){
                    score += scoreplus(a[i],2,4);
                    clear(a[i],2,4);
                }
            }

            if(clearnum == 0) break;
            REP(j,5){
                vector<int> V(0,0);
                REP(i,h){
                    if(a[i][j]) V.pb(a[i][j]);
                }
                REP(i,h){
                    a[i][j] = 0;
                }
                FOR(i,h-V.size(),h){
                    a[i][j] = V[i-(h-V.size())];
                }
            }
        }
        cout << score << endl;
    }
    return 0;
}

C++: #include "iostream"
#include "random"
#include "ctime"
#include "chrono"
#include "string"
#include "bitset"
#include "algorithm"
#include "map"
#include "queue"

using namespace std;


int main() {
	
	int H;
	const int W = 5;
	cin >> H;
	while (H) {
		vector<vector<int>>v(H, vector<int>(W));
		int ans = 0;
		for (int i = H - 1; i >= 0; i--) {
			for (int j = 0; j < W; j++) {
				cin >> v[i][j];
			}
		}
		bool flag = true;
		while (flag) {
			flag = false;
			for (int i = 0; i < H; i++) {
				vector<int>num(10,0);
				for (int j = 0; j < W; j++) {
					num[v[i][j]]++;
				}
				for (int j = 1; j < 10; j++) {
					if (num[j] >= 3) {
						for (int k = 0; k <= W - num[j]; k++) {
							int cnt = 0;
							for (int l = k; l < k + num[j]; l++) {
								cnt += j == v[i][l];
							}
							if (cnt == num[j]) {
								flag = true;
								ans += j*num[j];
								for (int k = 0; k < W; k++) {
									if (v[i][k] == j) {
										v[i][k] = 0;
									}
								}
							}
						}
					}
				}
			}
			for (int i = 1; i < H; i++) {
				for (int j = 0; j < W; j++){
					if (v[i][j]) {
						for (int k = i; k > 0; k--) {
							if (!v[k - 1][j]) {
								swap(v[k][j], v[k - 1][j]);
							}
						}
					}
				}
			}
		}
		cout << ans << endl;
		cin >> H;
	}

	return 0;
}

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

void d(vector<vector<int>> v,int h){
	for(int i=0;i<h;i++){
		for(int j=0;j<v[i].size();j++){
			cout<<v[i][j]<<" ";
		}
		cout<<"\n";
	}
	cout<<"\n";
}

int main (){
	int h;
	while(cin>>h && h){
		vector<vector<int>> v(h,vector<int>(5));
		for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>v[i][j];
		int ans=0;
		while(1){
			int flag=true;
			for(int i=0;i<h;i++){
				int chain;
				for(int j=0;j<5;j++){
					chain=1;
					while(j+1<5 && v[i][j]!=-1 && v[i][j]==v[i][j+1]){
						chain++;
						j++;
					}
					if(chain>=3){
						flag=false;
						ans+=chain*v[i][j];
						for(int k=0;k<chain;k++){
							v[i][j-chain+k+1]=-1;
						}
						break;
					}
				}
			}
			//d(v,h);
			for(int p=0;p<h;p++){
				for(int i=0;i<5;i++){
					for(int j=h-1;j>=1;j--){
						if(v[j][i]==-1){
							for(int k=j;k>=1;k--)swap(v[k][i],v[k-1][i]);
						}
					}
				}
			}

			//d(v,h);
			if(flag)break;
		}
		cout<<ans<<endl;
	}


}

/*
5 8 105
8 5 105
1 2 24
99 98 24
12 13 26
1 22 23
1 13 201
13 16 112
2 24 50
1 82 61
1 84 125
1 99 999
99 1 999
98 99 999
1 99 11
99 1 12
0 0 0
*/