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<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1193&lang=jp>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

int H;

ll check(vector<int>& vec){
    ll ret = 0;
    
    for(int i = 0; i < 3;i++){
        ll t = vec[i];
        ll cnt = 1;
        for(int j = i+1; j < 5;j++){
            if(vec[j] != t) break;
            cnt++;
        }
        if(cnt >= 3){
            for(int j = i; j < i+cnt;j++){
                vec[j] = 0;
            }
            ret += t*cnt;
            return ret;
        }
    }
    return ret;
}
ll solve(){
    ll res = 0;
    vector<vector<int>> Stone(H,vector<int>(5,0));
    for(int i = H-1; i >= 0; i--){
        for(int j = 0; j < 5;j++){
            cin >> Stone[i][j];
        }
    }
    while(true){
        ll t = res;
        for(int i = H-1; i >= 0; i--){
            res += check(Stone[i]);
        }
        if(t == res) break;
        while(true){
            bool update = false;
            for(int i = 0; i < H-1;i++){
                for(int j = 0; j < 5;j++){
                    if(Stone[i][j] == 0 && Stone[i+1][j] != 0){
                        update = true;
                        swap(Stone[i][j],Stone[i+1][j]);
                    }
                }
            }
            if(!update) break;
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    while(cin >> H,H){
        cout << solve() << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <queue>
#include <cctype>
#include <climits>
#include <stack>
#include <unordered_map>
  
using namespace std;


int main(){

	int h;
	int st[10][5];
	bool next;
	while(cin>>h,h){
		next=true;
		
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++) scanf("%d",&st[i][j]);
		}
		
		int res=0;
		while(next){
			next=false;
			
			for(int i=0;i<h;i++){
				for(int left=0;left+2<5;left++){
					int right=left;
					while(right+1<5 && st[i][right+1]==st[i][left]) right++;
					
					//cout<<left<<" "<<right<<endl;
					
					if(right-left+1>=3){
						
						res+=(right-left+1)*st[i][left];
						for(int j=left;j<=right;j++) st[i][j]=0;
					}
					left=right;
				}
			}
			
			for(int i=h-2;i>=0;i--){
				for(int j=0;j<5;j++){
					if(st[i][j]==0) continue;
					int pos=i;
					while(pos+1<h && st[pos+1][j]==0){
						next=true;
						swap(st[pos][j],st[pos+1][j]);
						pos++;
					}
				}
			}
		}
		cout<<res<<endl;
		
	}
	
	return 0;
}