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>
using namespace std;

int main(){
    int h;
    while(cin >> h, h){
        int d[11][6] = {0};
        for(int i = 0; i < h; i++){
            for(int j = 0; j < 5; j++){
                cin >> d[i][j];
            }
        }
        int score = 0;
        bool f = true;
        while(f){
            f = false;
            for(int i = 0; i < h; i++){
                for(int j = 0; j < 5; j++){
                    if(d[i][j] <= 0) continue;
                    int now = d[i][j];
                    int count = 1;
                    for(int k = j + 1; k < 5; k++){
                        if(d[i][k] == now){
                            count++;
                        }else{
                            break;
                        }
                    }
                    if(count >= 3){
                        f = true;
                        score += now * count;
                        for(int k = j; k < j + count; k++){
                            d[i][k] = -1;
                        }
                        break;
                    }
                }
            }
            for(int i = 0; i < 5; i++){
                for(int j = h - 1; j > 0; j--){
                    if(d[j][i] == -1){
                        for(int k = j - 1; k >= 0; k--){
                            if(d[k][i] > 0){
                                swap(d[j][i], d[k][i]);
                                break;
                            }
                        }
                    }
                }
            }
        }
        cout << score << endl;
    }
}

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

int H;
int a[10][5];

int main() {
    while (cin >> H, H) {
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < 5; j++) {
                cin >> a[i][j];
            }
        }
        bool update = true;
        int ans = 0;
        while (update) {
            update = false;
            for (int i = 0; i < H; i++) {
                int l = 0, r = 0;
                while (l < 5) {
                    while (r < 5 && a[i][r] == a[i][l]) {
                        r++;
                    }
                    if (a[i][l] && r - l >= 3) {
                        ans += (r - l) * a[i][l];
                        for (int j = l; j < r; j++) {
                            a[i][j] = 0;
                        }
                        update = true;
                    }
                    l = r;
                }
            }
            for (int j = 0; j < 5; j++) {
                vector<int> tmp;
                for (int i = H - 1; i >= 0; i--) {
                    if (a[i][j]) {
                        tmp.emplace_back(a[i][j]);
                    }
                    a[i][j] = 0;
                }
                for (int i = 0; i < (int)tmp.size(); i++) {
                    a[H - 1 - i][j] = tmp[i];
                }
            }
        }
        cout << ans << endl;
    }
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;


void fall(vector<vector<int>>&stones) {
	for (int t = 0; t < 5; ++t) {
		for (int y = stones.size()-1; y > 0; --y) {
			for (int x = 0; x < 5; ++x) {
				if (stones[y][x] == -1 && stones[y - 1][x]!=-1) {
					stones[y][x] = stones[y - 1][x];
					stones[y - 1][x] = -1;
				}
			}
		}
	}
}

int getans(vector<vector<int>>&stones) {
	vector<vector<bool>>banishes(stones.size(), vector<bool>(5, false));
	int score = 0;
	for (int y = 0; y < stones.size(); ++y) {
		for (int l = 0; l < 3; ++l) {
			if (stones[y][l] == stones[y][l + 1] && stones[y][l + 1] == stones[y][l + 2] && stones[y][l] != -1) {
				for (int x =l; x < l+3; ++x) {
					banishes[y][x] = true;
				}
			}
		}
	}
	for (int y = 0; y < stones.size(); ++y) {
		for (int x = 0; x < 5; ++x) {
			if (banishes[y][x]) {
				score += stones[y][x];
				stones[y][x] = -1;
			}
		}
	}
	if (score) {
		fall(stones);
		return score + getans(stones);
	}
	else {
		return 0;
	}
}
int main() {
	while (1) {
		int N; cin >> N;
		if (N) {
			vector<vector<int>>stones(N, vector<int>(5));
			for (int y = 0; y < N; ++y) {
				for (int x = 0; x < 5; ++x) {
					cin >> stones[y][x];
				}
			}
			int ans = getans(stones);
			cout << ans << endl;
		}
		else {
			break;
		}
	}
	return 0;
}