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 <algorithm>

using namespace std;

void solve()
{
	int H;
	while (cin >> H, H)
	{
		vector< vector<int> > stone(H, vector<int>(5));
		for (int i = 0; i < H; ++i)
		{
			for (int j = 0; j < 5; ++j)
			{
				cin >> stone[i][j];
			}
		}
		int preSum = -1;
		int sum = 0;
		bool update = true;
		while (preSum != sum)
		{
			preSum = sum;
			for (int i = 0; i < H; ++i)
			{
				if (stone[i][0] == stone[i][1] && stone[i][1] == stone[i][2] && stone[i][2] == stone[i][3] && stone[i][3] == stone[i][4])
				{
					sum += stone[i][0] * 5;
					stone[i][0] = stone[i][1] = stone[i][2] = stone[i][3] = stone[i][4] = 0;
				}
				else if (stone[i][0] == stone[i][1] && stone[i][1] == stone[i][2] && stone[i][2] == stone[i][3])
				{
					sum += stone[i][0] * 4;
					stone[i][0] = stone[i][1] = stone[i][2] = stone[i][3] = 0;
				}
				else if (stone[i][1] == stone[i][2] && stone[i][2] == stone[i][3] && stone[i][3] == stone[i][4])
				{
					sum += stone[i][1] * 4;
					stone[i][1] = stone[i][2] = stone[i][3] = stone[i][4] = 0;
				}
				else if (stone[i][0] == stone[i][1] && stone[i][1] == stone[i][2])
				{
					sum += stone[i][0] * 3;
					stone[i][0] = stone[i][1] = stone[i][2] = 0;
				}
				else if (stone[i][1] == stone[i][2] && stone[i][2] == stone[i][3])
				{
					sum += stone[i][1] * 3;
					stone[i][1] = stone[i][2] = stone[i][3] = 0;
				}
				else if (stone[i][2] == stone[i][3] && stone[i][3] == stone[i][4])
				{
					sum += stone[i][2] * 3;
					stone[i][2] = stone[i][3] = stone[i][4] = 0;
				}
			}
			for (int i = H - 1; i >= 0; --i)
			{
				for (int j = 0; j < 5; ++j)
				{
					if (stone[i][j] == 0)
					{
						int pos = i - 1;
						while (pos >= 0 && stone[pos][j] == 0)
						{
							--pos;
						}
						if (pos >= 0)
						{
							swap(stone[i][j], stone[pos][j]);
						}
					}
				}
			}
		}
		cout << sum << endl;
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h;
    while(1){
        cin >> h;
        if(h == 0) break;
        int d[11][5];
        rep(i, 0, h){
            rep(j, 0, 5){
                cin >> d[i][j];
            }
        }
        int ans = 0;
        while(1){
            bool f = false;
            rep(i, 0, h){
                rep(j, 0, 3){
                    bool g = true;
                    rep(k, j, j + 3){
                        if(d[i][k] == -1 || d[i][k] != d[i][j]) g = false;
                    }
                    if(g){
                        int tmp = d[i][j];
                        rep(k, j, 5){
                            if(d[i][k] == tmp){
                                d[i][k] = -1; ans += tmp;
                            }else{
                                break;
                            }
                        }
                        f = true;
                        break;
                    }
                }
            }
            if(f == false) break;
            rep(j, 0, 5){
                repb(i, h - 1, 0){
                    if(d[i][j] != -1) continue;
                    repb(k, i - 1, 0){
                        if(d[k][j] != -1){
                            swap(d[k][j], d[i][j]);
                            break;
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }   
}