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 <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <stack>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using pii = pair<int,int>;
int main(){
    int h;
    while(cin>>h,h){
        vector< vector<int> >v(h,vector<int>(5));
        for(auto& vec : v)
            for(auto& e : vec)
                cin  >> e;
        vector< pair<pii,int> >del;
        int ans = 0;
        bool flag = true;
        vector<vector<bool>>used(h,vector<bool>(5,true));
        while(flag){
            del.clear();
            for(int i = 0; i < h;i++){
                for(int j = 0; j < 4;j++){
                    if(!used[i][j])continue;
                    bool foo=true;
                    int cnt = 1;
                    int k= j + 1;
                    while (foo && k < 5) {
                        if(!used[i][k])break;
                        if(v[i][j] == v[i][k]){
                            cnt++;
                            k++;
                        } else {
                            foo = false;
                        }
                    }
                    if(cnt < 3)continue;
                    del.emplace_back(pii(i,j),cnt);
                    rep(_,cnt-1) used[i][ j+_]=false;
                    ans += cnt * v[i][j];
                }
            }
            if(del.empty())
                break;
            vector<vector<int>>temp(h,vector<int>(5));
            rep(i,h){
                rep(j,5){
                    rep(k,del.size()){
                        if(del[k].first==pii(i,j)){
                            rep(_,del[k].second){
                                used[del[k].first.first][del[k].first.second+_]=false;
                            }
                        }
                    }
                }
            }
            int last[10000]={0};
            for(int i=h-1; i>=0;i--){
                rep(j,5){
                    if(!used[i][j])continue;
                    {
                        temp[(h-1-last[j])][j] = v[i][j];
                        used[h-1-last[j]][j]=true;
                        last[j]++;
                        
                    }
                }
            }
            v = temp;
        }
        cout << ans << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	long long int N;
	while( cin >> N, N ) {
		long long int ans = 0;
		vector<vector<long long int>>d( N + 1, vector<long long int>( 5 ) );
		for( size_t i = 1; i <= N; i++ ) {
			for( size_t j = 0; j < 5; j++ ) {
				cin >> d[i][j];
				ans += d[i][j];
			}
		}
		bool f = true;
		while( f ) {
			f = false;
			for( size_t i = 1; i <= N; i++ ) {
				if( d[i][2] ) {
					int now = d[i][2];
					int count = 1;
					int j = 3, k = 1;
					while( j < 5 && now == d[i][j] ) j++;
					while( k >= 0 && now == d[i][k] ) k--;
					if( j - k >3 ) {
						f = true;
						for( size_t l = k + 1; l < j; l++ ) {
							d[i][l] = 0;
						}
					}
				}
			}
			for( int i = N; i >= 1; i-- ) {
				for( size_t j = 0; j < 5; j++ ) {
					if( !d[i][j] ) {
						int k = i;
						while( k > 0 && !d[k][j] ) k--;
						if( k != 0 ) swap( d[i][j], d[k][j] );
					}
				}
			}
		}
		for( size_t i = 0; i <= N; i++ ) {
			for( size_t j = 0; j < 5; j++ ) {
				ans -= d[i][j];
			}
		}
		cout << ans << endl;
	}
}