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;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
// sort(a.begin(), a.end(), std::greater<int>());

/*
std::vector<std::string> split(const std::string &input, char delimiter)
{
    std::istringstream stream(input);

    std::string field;
    std::vector<std::string> result;
    while (std::getline(stream, field, delimiter))
    {
        result.push_back(field);
    }
    return result;
}
*/

int main()
{
    int n;
    while (cin >> n)
    {
        if (n == 0)
            break;
        int a[n][6];
        int ans = 0;
        //input
        rep(i, n)
        {
            rep(j, 5)
            {
                cin >> a[i][j];
            }
            a[i][5] = 100;
        }
        //solve

        bool flag = true;
        while (true)
        {
            if (flag == false)
                break;

            flag = false;
            rep(i, n)
            {
                int count = 0;
                int num = 0;
                int begin = -1, end = -1;
                rep(j, 6)
                {
                    if (a[i][j] == a[i][j + 1] && a[i][j] != 0)
                    {
                        count++;
                        if (begin == -1)
                        {
                            count++;
                            begin = j;
                        }
                    }
                    else if (count >= 3)
                    {
                        //テヲツカツ暗」ツ??
                        flag = true;
                        if (DEBUG)
                            cout << i << begin << endl;
                        ans += count * a[i][begin];
                        rep(k, count)
                            a[i][begin + k] = 0;
                        break;
                    }
                    else
                    {
                        begin = -1;
                        count = 0;
                    }
                }
            }
            if (DEBUG)
            {
                cout << "before" << endl;
                rep(i, n)
                {
                    rep(j, 6)
                    {
                        cout << a[i][j] << " ";
                    }
                    cout << endl;
                }
                cout << endl;
                cout << endl;
            }
            //テァツァツサテ・ツ仰?
            stack<int> move;

            rep(j, 5)
            {
                rep(i, n)
                {
                    if(a[i][j]!=0){
                        move.push(a[i][j]);
                        a[i][j]=0;
                    }
                }
                for(int i=n-1;i>=0;i--){
                    if(move.empty()==false){
                        a[i][j]=move.top();
                        move.pop();
                    }
                }
            }

            if (DEBUG)
            {
                rep(i, n)
                {
                    rep(j, 6)
                    {
                        cout << a[i][j] << " ";
                    }
                    cout << endl;
                }
                cout << endl;
            }
        }
        cout << ans << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
	int h;

	while (scanf("%d", &h), h){
		vector<vector<int> > v;

		v.resize(h);

		for (int i = 0; i < h; i++){
			v[i].resize(5);
		}

		for (int i = 0; i < h; i++){
			for (int j = 0; j < 5; j++){
				scanf("%d", &v[i][j]);
			}
		}

		int sum = 0;
		bool nico = true;

		while (nico){
			nico = false;

			for (int i = 0; i < h; i++){
				int flag = 0;
				int pos = 0;

				for (int j = 1; j < 5; j++){
					if (v[i][j - 1] == v[i][j] && v[i][j] != 0){
						flag++;
					}
					else if (flag > 1){
						break;
					}
					else {
						flag = 0;
						pos = j;
					}
				}

				if (flag > 1){
					for (int j = pos; j <= pos + flag; j++){
						sum += v[i][j];
						v[i][j] = 0;
					}

					nico = true;
				}
			}

			for (int i = h - 1; i > 0; i--){
				for (int j = 0; j < 5; j++){
					if (v[i][j] == 0){
						int k = i - 1;

						while (v[k][j] == 0 && k > 0){
							k--;
						}

						v[i][j] = v[k][j];
						v[k][j] = 0;
					}
				}
			}
		}

		printf("%d\n", sum);
	}

	return (0);
}