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;
 
typedef long long ll;
typedef pair<int, int> pii;
 
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define debug(x) cout << #x << ": " << x << endl
#define ALL(x) (x).begin(),(x).end()
 
const int INF = 1e9;
const ll LINF = 1e16;
 
int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
 
    int H;
    int c = 0;
    while (1) {
        cin >> H;
        if (H == 0) break;
        vector<vector<int>> yama(H + 2, vector<int>(7, INF));
        for (int i = H; i >= 1; i--) {
            for (int j = 1; j <= 5; j++) {
                cin >> yama[i][j];
            }
        }
        //cout << "hello" << endl;
        int ret = 0;
        bool f = false;
        do {
 
            f = false;
            for (int i = 1; i <= H; i++) {
                int count = 0;
                int n = -1;
                for (int j = 1; j <= 6; j++) {
                    if (yama[i][j] != n) {
                        if (count >= 3) {
                            if (n != INF) {
                                ret += (count*n);
                                f = true;
                                for (int k = j - count; k < j; k++) {
                                    yama[i][k] = INF;
                                }
                            }
                            break;
                        }
                        count = 1;
                        n = yama[i][j];
                    }
                    else {
                        count++;
                    }
                }
            }
         
 
            for (int i = 1; i <= H; i++) {
                for (int j = 1; j <= 5; j++) {
                    if (yama[i][j] == INF) {
                        for (int k = i + 1; k <= H; k++) {
                            if (yama[k][j] != INF) {
                                yama[i][j] = yama[k][j];
                                yama[k][j] = INF;
                                break;
                            }
                        }
                    }
                }
            }
 
        } while (f);
        cout << ret << endl;
        c++;
    }
 
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
    int n;
    while(cin >> n, n){
        int field[n][5];
        for(int i=0; i < n; i++){
            for(int j=0; j < 5; j++) cin >> field[i][j];
        }


        int point = 0;
        while(1){
            int save = point;
            for(int i=0; i < n; i++){
                for(int j=0; j < 5; j++){
                    if(field[i][j] == field[i][j+1]){
                        int count = 0;
                        for(int k=j; k < 5; k++){
                            if(field[i][j] == field[i][k]) count++;
                            else break;
                        }
                        if(3 <= count){
                            point += field[i][j]*count;
                            for(int k=0; k < count; k++) field[i][j+k] = 0;
                        }
                    }
                }
            }

            if(point == save || n == 1) break;

            for(int i = n-1; 0 < i; i--){
                for(int j=0; j < 5; j++){
                    if(field[i][j] == 0){
                        for(int k=0; 0 <= i-k; k++){
                            if(field[i-k][j] != 0){
                                field[i][j] = field[i-k][j];
                                field[i-k][j] = 0;
                                break;
                            }
                        }
                    }
                }
            }
        }
        cout << point << endl;
    }
}