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>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 1000000
using namespace std;
int table[10][10];
int cnt,check,flag,tmp_flag;
queue<pair<int,int> > que;
int search(int y,int x){
    que.push(pair<int,int>(y,x));
    cnt++;
    x++;
    if(x < 5){
        if(table[y][x] == check) search(y,x);
    }
    if(cnt >= 3) {
        tmp_flag = true;
        return cnt;
    }
    else return 0;
}
int main(){
    int n;
    while(cin >> n,n){
        rep(i,n){
            rep(j,5){
                cin >> table[i][j];
            }
        }
        int point = 0;
        flag = true;
        while(flag){
            flag = false;
            rep(i,n){
                rep(j,5) {
                    if(table[i][j] == 0) continue;
                    tmp_flag = false;
                    cnt = 0;
                    check = table[i][j];
                    point += check*search(i,j);
                    if(tmp_flag){
                        flag = true;
                        while(!que.empty()){
                            pair<int,int> tmp = que.front();
                            que.pop();
                            table[tmp.first][tmp.second] = 0;
                        }
                    }
                    else while(!que.empty()) que.pop();
                }
            }
            if(!flag) continue;
            for(int i=n-1; i>=1; i--){
                for(int j=4; j>=0; j--){
                    if(table[i][j] != 0) continue;
                    for(int k=i; k>=0; k--){
                        if(table[k][j] == 0) continue;
                        swap(table[i][j],table[k][j]);
                        break;
                    }
                }
            }
        }
        cout << point << endl;
    }
    return 0;
}

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

typedef ostringstream OSS;
typedef istringstream ISS;

typedef long long LL;
typedef pair<int, int> PII;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<PII> VPII;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back 
#define ALL(x) (x).begin(),(x).end()
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define rep(i, N) for (int i = 0; i < (N); i++)
#define rep2(i, j, N, M) rep(i, N) rep(j, M)
#define rep3(i, j, k, N, M, L) rep(i, N) rep(j, M) rep(k, L)
#define REP(i, init, N) for (int i = (init); i < (N); i++)

template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a) { OSS oss; oss << a; return oss.str(); };

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

constexpr int W = 5;
int H;
VVI ts;

int score;

bool can_remove(int y, int x0) {
    int c = ts[y][x0];
    if (c == 0) return false;

    int cnt = 0;

    REP(x, x0, W) {
        if (ts[y][x] != c) break;
        ++cnt;
    }

    return cnt >= 3;
}

void remove_ts(int y, int x0) {
    int c = ts[y][x0];

    REP(x, x0, W) {
        if (ts[y][x] == c) {
            score += ts[y][x];
            ts[y][x] = 0;
        } else {
            return;
        }
    }
}

void fall_down() {
    for (int y = H - 1; y >= 0; --y) {
        rep(x, W) {
            REP(y2, y + 1, H) {
                if (ts[y2][x] == 0) {
                    ts[y2][x] = ts[y2 - 1][x];
                    ts[y2 - 1][x] = 0;
                }
            }
        }
    }
}

bool remove_all_ts() {
    bool removed = false;

    rep2(y, x, H, W) {
        if (can_remove(y, x)) {
            remove_ts(y, x);
            removed = true;
        }
    }

    return removed;
}

void dump() {
    rep(y, H) {
        rep(x, W) {
            cout << ts[y][x] << " ";
        }
        cout << endl;
    }
}

int solve() {
    score = 0;

    while (remove_all_ts()) {
        fall_down();
    }

    return score;
}

int main(void) {
    while (cin >> H, H) {
        ts.clear();
        ts.resize(H, VI(W));

        rep2(y, x, H, W) {
            cin >> ts[y][x];
        }

        cout << solve() << endl;
    }

	return 0;
}