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 <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

void solve(int N) {
    VVI mas(N, VI(5));
    REP(i, N)REP(j, 5) {
        scanf("%d", &mas[i][j]);
    }
    int ans = 0;
    while (true) {
        bool Flag = false;
        REP(i, N)REP(j, 3) {
            int def = mas[i][j];
            if (def == 0) continue;
            int renzoku = 0;
            bool f = false;
            for (int k = j + 1; k < 5; k++) {
                if (def != mas[i][k]) {
                    renzoku = k - j;
                    break;
                }
                if (k == 4) f=true; 
            }
            if (f) renzoku = 5 - j;
            if (renzoku >= 3) {
                Flag = true;
                ans += def * renzoku;
                for (int k = j; k < j + renzoku; k++) {
                    mas[i][k] = 0;
                }
            }
        }
        if (!Flag) break;
        REP(_, N + 10) {
            FOR(i, 1, N) {
                REP(j, 5) {
                    if (mas[i][j] == 0) {
                        mas[i][j] = mas[i - 1][j];
                        mas[i - 1][j] = 0;
                    }
                }
            }
        }
    }
    cout << ans << endl;
    return;
}

signed main(void) {
    LL n, m, p, a, b, c, x, y, z, q;
    string s;
    bool f = false;
    while (cin >> n, n) {
        solve(n);
        //return 0;
    }
}

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

int main(){
	while(1){
		int H;
		cin>>H;

		if(H==0)
			break;

		int S[10][5];
		for(int y=0;y<H;y++)
			for(int x=0;x<5;x++)
				cin>>S[x][y];
	
		int sco=0;
	
		while(1){
			bool flg=false;
	
			for(int y=0;y<H;y++){
				int m=S[y][2];
				if(m==0)
					continue;
	
				if(S[y][0]==m&&S[y][1]==m){
					sco+=m*3;S[y][0]=S[y][1]=S[y][2]=0;flg=true;
					if(S[y][3]==m){
						sco+=m;S[y][3]=0;
						if(S[y][4]==m){
							sco+=m;S[y][4]=0;
						}
					}
				}
				else if(S[y][1]==m&&S[y][3]==m){
					sco+=m*3;S[y][1]=S[y][2]=S[y][3]=0;flg=true;
					if(S[y][4]==m){
						sco+=m;S[y][4]=0;
					}
				}
				else if(S[y][3]==m&&S[y][4]==m){
					sco+=m*3;S[y][2]=S[y][3]=S[y][4]=0;flg=true;
				}
			}
	
			if(!flg)
				break;
		
			for(int x=0;x<5;x++){
				for(int y=H-1;y>=0;y--){
					if(S[y][x]!=0)
						continue;

					for(int y2=y-1;y2>=0;y2--){
						if(S[y2][x]!=0){
							S[y][x]=S[y2][x];S[y2][x]=0;break;
						}
					}
				}
			}
		}

		cout<<sco<<endl;
	}

	return 0;
}