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 PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int H;
int fld[5][10];
void drop(){
      bool pp;
      REP(i,5){
            REP(j,H){
                  if(fld[i][j]==-1){
                        for(int k=j;k<H;k++){
                              if(fld[i][k]!=-1){
                                    swap(fld[i][k],fld[i][j]);
                                    break;
                              }
                        }
                  }
            }
      }
}
int main(){
      while(cin>>H&&H){
            for(int i=H-1;i>=0;i--)REP(j,5)cin>>fld[j][i];
            bool update=true;
            int ans=0;
            while(update){
                  update=false;
                  REP(i,H){
                        int s,e,j=0;bool change=false;
                        while(j<5){
                              if(fld[j][i]==-1){
                                    j++;
                                    continue;
                              }
                              s=j;
                              while(fld[s][i]==fld[j][i])j++;
                              if(j-s>=3){
                                    e=j;
                                    change=true;
                                    break;
                              }
                        }
                        if(change){
                              update=true;
                              ans+=(e-s)*fld[s][i];
                              for(int j=s;j<e;j++)fld[j][i]=-1;
                        }
                  }
                  drop();
            }
            cout<<ans<<endl;
      }
}

C++: #include<iostream>
#include<vector>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int h, tmp;
	while (cin >> h, h) {
		vector<vector<int>>v(h, vector<int>());
		rep(i, h) {
			rep(j, 5) {
				cin >> tmp;
				v[i].push_back(tmp);
			}
		}
		bool flag = true;
		int ns = 0;
		while (flag) {
			flag = false;
			//?¶????
			rep(i, h) {
				rep(j, 5) {
					tmp = 0;
					while (true) {
						if (v[i][j] == 0 || (j + tmp + 1) == 5)break;
						if (v[i][j] == v[i][j + tmp + 1])tmp++;
						else break;
					}
					if (tmp >= 2) {
						ns += v[i][j] * (tmp + 1);
						rep(k, tmp + 1)v[i][j + k] = 0;
						flag = true;
					}
				}
			}
			//?????¨???
			bool cont = true;
			while (cont) {
				cont = false;
				for (int i = h - 1; i > 0; i--) {
					rep(j, 5) {
						if (v[i][j] == 0 && v[i - 1][j]) {
							v[i][j] = v[i - 1][j];
							v[i - 1][j] = 0;
							cont = true;
						}
					}
				}
			}
		}
		cout << ns << endl;
	}		
	return 0;
}

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;
}