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 <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
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 FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }

int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60

int main() {
    while(true) {
        int H;
        cin >> H;
        if(H == 0) break;

        vector< vector<int> > block(H + 2, vector<int>(7, -1));
        REP(i, H) {
            REP(j, 5) cin >> block[i+1][j+1];
        }

        bool update = true;
        int ans = 0;
        while(update) {
            update = false;
            FOR(i, 1, H) {
                int prev = -1, cont = 0;
                FOR(j, 1, 6) {
                    if(block[i][j] == prev && block[i][j] > 0) cont++;
                    else {
                        if(cont >= 3) {
                            ans += cont * prev;
                            REP(k, cont) {
                                block[i][j-1-k] = 0;
                            }
                            update = true;
                        }
                        prev = block[i][j];
                        cont = 1;
                    }
                }
            }

            // 0の部分を詰める
            bool has_zero = false;
            if(update) has_zero = true;
            REP(cnt, H) {
                has_zero = false;
                FORR(i, H, 1) {
                    FOR(j, 1, 5) {
                        if(block[i][j] == 0) {
                            block[i][j] = block[i-1][j];
                            block[i-1][j] = 0;
                        }
                    }
                }
            }
            // cerr << "-------------------------------" << endl;
            // FOR(i, 1, H) {
            //     FOR(j, 1, 5) cerr << block[i][j];
            //     cerr << endl;
            // }
            // cerr << "-------------------------------" << endl;
        }
        cout << ans << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long long INF = 1001001001;
const long long MOD = 1000000007;
const double EPS = 1e-10;

bool solve(){
    int h;
    cin>>h;
    if(h==0)return true;
    int grid[h+1][5]={};
    for(int i=0;i<h;i++){
        for(int j=0;j<5;j++){
            cin>>grid[i+1][j];
        }
    }
    int ans=0;
    bool update=true;
    while(update){
        int fall[h+1][5]={};
        update=false;
        for(int i=1;i<=h;i++){
            int left=17320508,right=-141421356;
            for(int le=0;le<5;le++){
                int val=grid[i][le];
                for(int ri=le+2;ri<5;ri++){
                    bool flag=true;
                    for(int j=le;j<=ri;j++){
                        if(val!=grid[i][j]||grid[i][j]==0)flag=false;
                    }
                    if(flag){
                        left=min(left,le);
                        right=max(right,ri);
                    }
                }
            }
            for(int k=left;k<=right;k++){
                ans+=grid[i][k];
                grid[i][k]=0;
                for(int j=i-1;j>=0;j--)fall[j][k]++;
            }
        }
        for(int i=h;i>=0;i--){
            for(int j=0;j<5;j++){
                if(fall[i][j]>0){
                    update=true;
                    grid[i+fall[i][j]][j]=grid[i][j];
                    grid[i][j]=0;
                    fall[i][j]=0;
                }
            }
        }
    }
    cout<<ans<<endl;
    return false;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(!solve());
}