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 <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define FORR(i,a,b) for (int i=a; i>=b; i--)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;

int main(void) {
    int h;

    while(1){
        cin >> h;
        if (h==0)
            break;

        int score = 0;
        int a[10][5] = {};

        REP(i,h){
            REP(j,5){
                cin >> a[h-i-1][j];
            }
        }


        bool f = 1;
        while (f){
            f = 0;
            REP(i,h){
                int s = 1;
                int c = a[i][2];
                if (c==0) continue;
                int p = 1;
                while (a[i][p] == c && p>=0){
                    s++;
                    p--;
                }
                p = 3;
                while (a[i][p] == c && p<5){
                    s++;
                    p++;
                }

                if (s>=3){
                    f = 1;
                    score += s*c;
                    REP(j,5){
                        if (a[i][j] == c)
                            a[i][j] = 0;
                    }
                }
            }
            REP(j,5){
                int k = 0;
                REP(i,h){
                    if (a[i][j]>0)
                        a[k++][j] = a[i][j];
                }
                while(k<h)
                    a[k++][j] = 0;
            }
        }

        cout << score << endl;

    }
    
    return 0;
}

C++: //今日の成果*AOJ0027*AOJ0028


#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(int x){stringstream ss;ss<<x;return ss.str();}
int main(){
	
	int h,ans=0;
	while(cin>>h,h!=0){
	ans=0;
	int ta[200][5]={{0},{0}};
	for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>ta[i][j];
	//盤面の存在しないところは0
	while(true){
	bool f=1;
	for(int i=0;i<h;i++){
	int cnt=0,fi=0;
		for(int j=0;j<3;j++){
			if(ta[i][j]==ta[i][j+1]&&ta[i][j]==ta[i][j+2]&&ta[i][j]!=0){
			cnt++;
			if(fi==0)fi=j;
			}
		}//endfor
		if(cnt!=0)ans+=ta[i][fi]*(2+cnt),f=0;
		if(cnt!=0)for(int j=0;j<2+cnt;j++)ta[i][fi+j]=0;
	}//endfor
	if(f)break;
	//落とす処理
	for(int i=h-2;i>=0;i--){
		for(int j=0;j<5;j++){
			int ti=i;
			while(true){
			if(ti==h-1||ta[ti+1][j]!=0)break;
			ta[ti+1][j]=ta[ti][j];
			ta[ti][j]=0;
			ti++;
			}//endwhile
		}//endfor
	}//endfor
	}//endwhile
	cout<<ans<<endl;
	}//endwhile
	return 0;
}

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

int n ;
vector<vector<int> > d;

void Erase () {
    for (int i = 0; i < 5; i++) {
        for (int j = n - 1; j >= 0; j--) {
            if (d[j][i] == 0) {
                int k = j;
                bool flag = true;
                while (k >= 0 && d[k][i] == 0) {
                    k--;
                    if (k < 0) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    d[j][i] = d[k][i];
                    d[k][i] = 0;
                }
            }
        }
    }
}

int Check () {
    int ret = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 5; j++) {
            int count = 0;
            int num = d[i][j];
            int k = j;
            while (num != 0 && d[i][k] == num) {
                count++;
                k++;
            }

            if (count >= 3) {
                ret += count * num;
                while (k > j) {
                    k--;
                    d[i][k] = 0;
                }

                break;
            }
        }
    }

    Erase();

    return ret;
}

int main ()
{
    while (cin >> n, n) {
        d.clear();
        d.resize(n, vector<int>(5));
        for (auto &i : d)
            for (auto &j : i) cin >> j;

        int num = 1;
        int res = 0;
        while (num > 0) {
            //Erase();
            num = Check();
            res += num;
        }

        cout << res << endl;
    }

    return 0;
}