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,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define pb(a) push_back(a)

using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

int main() {
    int puz[10][5] = {};
    bool isdelete[10][5];
    int n;
    while(cin >> n) {
        if(n == 0) break;
        rep(i,0,n) {
            rep(j,0,5) cin >> puz[n-1-i][j];
        }

        /*rep(i,0,n) {
            rep(j,0,5) cout << puz[i][j] << " ";
            cout << endl;
        }*/

        int x = 0;
        int cnt = 1;
        bool flag;
        int ret = 0;
        int temp = 0;
        while(1) {
            rep(i,0,n) {
                rep(j,0,5) {
                    isdelete[i][j] = false;
                }
            }

            rep(i,0,n) {
                rep(j,0,5) {
                    if(puz[i][j] == x && x != 0) cnt++;
                    else {
                        cnt = 1;
                        x = puz[i][j];
                    }

                    if(cnt >= 3) {
                        //cout << "true" << endl;
                        flag = true;
                        rep(k,j-cnt+1,j+1) isdelete[i][k] = true;
                        temp = cnt * x;
                    }
                }
                ret += temp;
                x = 0;
                cnt = 1;
                temp = 0;
            }
            if(!flag) break;
            rep(i,0,n) {
                rep(j,0,5) {
                    if(isdelete[i][j]) puz[i][j] = 0;
                }
            }

            rep(i,0,n) {
                rep(j,0,5) {
                    int k = i;
                    while(k>=1 && puz[k-1][j] == 0) {
                        puz[k-1][j] = puz[k][j];
                        puz[k][j] = 0;
                        k--;
                    }
                }
            }

            /*cout << endl;
            rep(i,0,n) {
                rep(j,0,5) cout << puz[n-1-i][j] << " ";
                cout << endl;
            }*/

            flag = false;
        }

        cout << ret << endl;
        ret = 0;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h;
    while(1){
        cin >> h;
        if(h == 0) break;
        int d[11][5];
        rep(i, 0, h){
            rep(j, 0, 5){
                cin >> d[i][j];
            }
        }
        int ans = 0;
        while(1){
            bool f = false;
            rep(i, 0, h){
                rep(j, 0, 3){
                    bool g = true;
                    rep(k, j, j + 3){
                        if(d[i][k] == -1 || d[i][k] != d[i][j]) g = false;
                    }
                    if(g){
                        int tmp = d[i][j];
                        rep(k, 0, 5) if(d[i][k] == tmp){
                            d[i][k] = -1; ans += tmp;
                        }
                        f = true;
                        break;
                    }
                }
            }
            if(f == false) break;
            rep(j, 0, 5){
                repb(i, h - 1, 0){
                    if(d[i][j] != -1) continue;
                    repb(k, i - 1, 0){
                        if(d[k][j] != -1){
                            swap(d[k][j], d[i][j]);
                            break;
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }   
}