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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int main(){
	while(1){
		int h;
		cin >> h; if(h == 0) return 0;
		vector<int>x[5];
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				int a; cin >> a; x[j].pb(a);
			}
		}
		rep(i,5) reverse(x[i].begin(),x[i].end());
		int ret = 0;
		while(1){
			bool upd = 0;
			for(int i=0;i<h;i++){
				for(int j=0;j<3;j++){
					if(x[j].size() <= i || x[j+1].size() <= i || x[j+2].size() <= i) continue;
					if(x[j][i] == x[j+1][i] && x[j+1][i] == x[j+2][i]){
						if(j+3<5 && x[j+3][i] == x[j][i]){
							ret += x[j][i];
							x[j+3][i] = -1;
						}
						if(j+4<5 && x[j+4][i] == x[j][i]){
							ret += x[j][i];
							x[j+4][i] = -1;
						}ret += 3*x[j][i];
						x[j][i] = -1;
						x[j+1][i] = -1;
						x[j+2][i] = -1;
						//ret += 3*x[j][i];
						upd = 1;
						break;
					}
				}
			}
			vector<int>y[5];
			for(int i=0;i<5;i++){
				for(int j=0;j<x[i].size();j++){
					if(x[i][j] != -1) y[i].pb(x[i][j]);
				}
				x[i] = y[i];
			}
			//if(h==5)for(int i=0;i<5;i++) cout << x[i][0] << endl;
			if(!upd) break;
		}
		cout << ret << endl;
	}
}

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

int n ;
vector<vector<int> > d;

void Erase () {
    for (int i = 0; i < 5; i++) {
        for (int j = n - 1; j >= 0; j--) {
            if (d[j][i] == 0) {
                int k = j;
                bool flag = true;
                while (k >= 0 && d[k][i] == 0) {
                    k--;
                    if (k < 0) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    d[j][i] = d[k][i];
                    d[k][i] = 0;
                }
            }
        }
    }
}

int Check () {
    int ret = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 5; j++) {
            int count = 0;
            int num = d[i][j];
            int k = j;
            while (num != 0 && d[i][k] == num) {
                count++;
                k++;
            }

            if (count >= 3) {
                ret += count * num;
                while (k > j) {
                    k--;
                    d[i][k] = 0;
                }

                break;
            }
        }
    }

    Erase();

    return ret;
}

int main ()
{
    while (cin >> n, n) {
        d.clear();
        d.resize(n, vector<int>(5));
        for (auto &i : d)
            for (auto &j : i) cin >> j;

        int num = 1;
        int res = 0;
        while (num > 0) {
            //Erase();
            num = Check();
            res += num;
        }

        cout << res << endl;
    }

    return 0;
}

C++: 
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>

using namespace std;

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


int main(){

	while(1){

		int H;
		int sum = 0;
		cin >> H;

		if(H == 0){
			break;
		}

		vector< vector <int> > v(H, vector<int>(8));

		rep(i, H){
			rep(j, 5){
				cin >> v[i][j];
			}
		}

		while(1){

			int A = 0;

			rep(i, H){
				rep(j, 3){
					if(v[i][j] == v[i][j + 1] && v[i][j] == v[i][j + 2] ){
						sum += v[i][j] * 3;
						if(v[i][j] == v[i][j + 3]){
							sum += v[i][j];
							v[i][j + 3] = 0;
							if(v[i][j] == v[i][j + 4]){
								sum += v[i][j];
								v[i][j + 4] = 0;
							}
						}
						v[i][j] = 0;
						v[i][j + 1] = 0;
						v[i][j + 2] = 0;
					}
				}
			}


			while(1){
				int p = 0;
				rep(i,H - 1){
					rep(j, 5){
						if(v[i+1][j] == 0 && v[i][j] != 0){
							p++;
							A++;
							v[i+1][j] = v[i][j];
							v[i][j] = 0;
						}
					}
				}
				if(p == 0){
					break;
				}
			}
			
			if(A == 0){
				break;
			}
		}
		cout << sum << endl;
	}

	return 0;
}