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<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll h;
    const ll w = 5;
    while (cin >> h, h) {
        vector<vector<ll>> m(h, vector<ll>(w)); cin >> m;
        reverse(all(m));
        ll ans = 0;
        function<ll(ll,ll,ll,ll)> chain = [&](ll x, ll y, ll k, ll cnt) {
            if (k < 0 || x >= w || m[y][x] != k) return cnt;
            ll c = chain(x+1, y, k, cnt+1);
            if (c >= 3) {
                ans += m[y][x];
                m[y][x] = -1;
            }
            return c;
        };
        auto fall = [&]() {
            rep(y, h-1) rep(x, w) {
                if (m[y][x] < 0) {
                    m[y][x] = m[y+1][x];
                    m[y+1][x] = -1;
                }
            }
        };
        while (true) {
            bool is_updated = false;
            rep(y, h) rep(x, w) {
                if (chain(x, y, m[y][x], 0) >= 3) {
                    is_updated = true;
                }
            }
            if (!is_updated) break;
            rep(i, h) fall();
        }
        cout << ans << endl;
    }
}

C++: #include<stdio.h>

int main(){
    int H,i,j,P[10][5],Q[10][5],S,a,b;
    for(;scanf("%d",&H),H;){
        S=0;
        for(i=0;i<10;i++)for(j=0;j<5;j++)P[i][j]=-1;
        for(i=0;i<10;i++)for(j=0;j<5;j++)Q[i][j]=-1;
        
        for(i=10-H;i<10;i++)scanf("%d %d %d %d %d",&P[i][0],&P[i][1],&P[i][2],&P[i][3],&P[i][4]);
        
        //for(i=0;i<10;i++){for(j=0;j<5;j++)printf("%d ",P[i][j]);printf("\n");}
        b=0;
        for(;b==0;){
            b=1;
        for(i=0;i<10;i++)if(P[i][0]==P[i][1]&&P[i][0]==P[i][2]&&P[i][0]==P[i][3]&&P[i][0]==P[i][4]&&P[i][0]!=-1){
            S+=P[i][0]*5;
            P[i][0]=-1; P[i][1]=-1; P[i][2]=-1; P[i][3]=-1; P[i][4]=-1;
        }
        for(i=0;i<10;i++)if(P[i][0]==P[i][1]&&P[i][0]==P[i][2]&&P[i][0]==P[i][3]&&P[i][0]!=-1){
            S+=P[i][0]*4;
            P[i][0]=-1; P[i][1]=-1; P[i][2]=-1; P[i][3]=-1;
        }
        for(i=0;i<10;i++)if(P[i][0]==P[i][1]&&P[i][0]==P[i][2]&&P[i][0]!=-1){
            S+=P[i][0]*3;
            P[i][0]=-1; P[i][1]=-1; P[i][2]=-1;
        }
        for(i=0;i<10;i++)if(P[i][1]==P[i][2]&&P[i][1]==P[i][3]&&P[i][1]==P[i][4]&&P[i][1]!=-1){
            S+=P[i][1]*4;
            P[i][4]=-1; P[i][1]=-1; P[i][2]=-1; P[i][3]=-1;
        }
        for(i=0;i<10;i++)if(P[i][1]==P[i][2]&&P[i][1]==P[i][3]&&P[i][1]!=-1){
            S+=P[i][1]*3;
            P[i][1]=-1; P[i][2]=-1; P[i][3]=-1;
        }
        for(i=0;i<10;i++)if(P[i][2]==P[i][3]&&P[i][2]==P[i][4]&&P[i][2]!=-1){
            S+=P[i][2]*3;
            P[i][3]=-1; P[i][4]=-1; P[i][2]=-1;
        }
        //for(i=0;i<10;i++){for(j=0;j<5;j++)printf("%d ",P[i][j]);printf("\n");}
        a=0;
        for(;;){
            //for(i=0;i<10;i++)for(j=0;j<5;j++)if(Q[i][j]!=P[i][j])goto yare;
            if(a==1)break;
            a=1;
            yare:;
            
            for(i=0;i<9;i++)for(j=0;j<5;j++)if(P[i][j]!=-1&&P[i+1][j]==-1){
                P[i+1][j]=P[i][j];P[i][j]=-1;a=0;b=0;
            }
            
        //for(i=0;i<10;i++)for(j=0;j<5;j++)Q[i][j]=P[i][j];
        }
        
        //for(i=0;i<10;i++){for(j=0;j<5;j++)printf("%d ",P[i][j]);printf("\n");}
            
            
    }
        printf("%d\n",S);
    }
    return 0;
}