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;

#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;

int main() {
    vector<int> res;
    while (true) {
        int n;
        cin >> n;
        if (n == 0) break;
        vector<vector<int>> field(n, vector<int>(5));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 5; j++) {
                cin >> field[i][j];
            }
        }
        int cnt = 0;
        bool update = true;
        while (update) {
            update = false;
            bool col[5];          
            for (int i = 0; i < n; i++) {
                for (int i = 0; i < 5; i++) {
                    col[i] = false;
                }
                for (int j = 1; j <= 3; j++) {
                    if (field[i][j] != 0 and field[i][j - 1] == field[i][j] and field[i][j] == field[i][j + 1]) {
                        update = true;
                        col[j - 1] = col[j] = col[j + 1] = true;
                    }
                }
                for (int j = 0; j < 5; j++) {
                    if (col[j]) {
                        cnt += field[i][j];
                        field[i][j] = 0;
                    }
                }
            }
            for (int i = n - 2; i >= 0; i--) {
                for (int j = 0; j < 5; j++) {
                    int cur = i;
                    while (cur < n - 1 and field[cur + 1][j] == 0) {
                        swap(field[cur][j], field[cur + 1][j]);
                        cur++;
                    }
                }
            }
        }
        res.push_back(cnt);
    }
    for (int i = 0; i < (int)res.size(); i++) {
        dump(res[i]);
    }
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<set>
#include<map>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<string>
#include<vector>
#include<queue>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 1000000005
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PI;

int n;
int m[11][5];//???????????????
int erase(){
    int ret = 0;
    rep(i,n){
        int now = 0;
        int left = 0;
        while(now<5){
            while(m[i][left]==m[i][now])now++;
            if(now-left<3){
                left=now;
            }else{
                while(left<now){
                    ret += m[i][left];
                    m[i][left]=0;
                    left++;
                }
            }
        }
    }
    return ret;
}
void down(){
    rep(j,5){
        int down = 0;
        int now = 0;
        while(now<n){
            while(now<n&&!m[now][j])now++;
            if(now==n){
                break;
            }
            m[down][j]=m[now][j];
            if(down<now){
                m[now][j]=0;
            }
            down++;
            now++;
        }
    }
    return;
}

void show(){
    rep(i,n){
        rep(j,5){
            cout<<m[n-1-i][j]<<" ";
        }
        cout<<endl;
    }
    cout<<endl;
}

int main(){
    while(1){
        cin>> n;
        if(!n)
            break;
        rep(i,11){rep(j,5)m[i][j]=0;}
        rep(i,n){
            rep(j,5){cin>>m[n-1-i][j];}
        }
        int ans = 0;
        int temp;
        while(1){
            temp = erase();
//            show();
            ans += temp;
            if(!temp){
                break;
            }
            down();
//            show();
        }
        cout<<ans<<endl;
    }
}