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 enld '\n'
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// ---------------------------------------------------------------------------


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H;
    cin >> H;
    while(H != 0){
        vector<vector<int>> G(H,vector<int> (5));
        for(int i=0; i<H; i++){
            for(int j=0; j<5; j++){
                cin >> G[i][j];
            }
        }
        int ans = 0;
        while(1){
            bool did = false;
            for(int i=0; i<H; i++){
                for(int j=0; j<3; j++){
                    if(G[i][j] == -1) continue;
                    int cnt = 1;
                    while(j+cnt<5 and G[i][j] == G[i][j+cnt]){
                        cnt++;
                    }
                    if(cnt>=3){
                        did = true;
                        ans += cnt*G[i][j];
                        int temp = G[i][j];
                        while(G[i][j] == temp){
                            G[i][j] = -1;
                            j++;
                        }
                        break;
                    }
                }
            }
            while(1){
                bool did2 = false;
                for(int i=H-1; i>=1; i--){
                    for(int j=0; j<5; j++){
                        if(G[i][j] == -1 and G[i-1][j] != -1){
                            G[i][j] = G[i-1][j];
                            G[i-1][j] = -1;
                            did2 = true;
                        }
                    }
                }
                if(!did2) break;
            }
            if(!did) break;
        }
        cout << ans << enld;
        cin >> H;
    }
    return 0;
}

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

#define rep(i,n) for(int i=0;i<(n);i++)

int main()
{
	for(int h;cin>>h && h;){
		int a[h][5],res=0;
		rep(i,h) rep(j,5) cin>>a[i][j];
		for(;;){
			int add=0;
			for(int* b:a) for(int j=0;j<5;){
				if(b[j]==0){
					j++;
					continue;
				}
				int k=j;
				while(k<5 && b[k]==b[j]) k++;
				if(k-j>=3){
					add+=(k-j)*b[j];
					fill(b+j,b+k,0);
				}
				j=k;
			}
			if(add==0) break;
			res+=add;
			rep(i,5) for(int j=h,k=h;k--;)
				if(a[k][i]) swap(a[--j][i],a[k][i]);
		}
		cout<<res<<endl;
	}
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

const int MAX_H = 10;
int board[MAX_H+1][5];

int main(void) {
    int H;
    for (int j = 0; j < 5; j++) {
        board[MAX_H][j] = 0;
    }

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

        int score = 0;
        for (int i = H-1; i >= 0; i--) {
            for (int j = 0; j < 5; j++) {
                cin >> board[i][j];
            }
        }


        int del;
        do {
            int val, num;
            del = 0;

            cout << endl;
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < 5; j++) {
                    cout << board[i][j] << " ";
                }
                cout << endl;
            }


            for (int i = 0; i < H; i++) {
                num = 1;
                for (int j = 1; j < 5; j++) {
                    if (board[i][j] == board[i][j-1]) {
                        val = board[i][j];
                        num++;
                    } else if (num >= 3) {
                        break;
                    } else {
                        num = 1;
                    }
                }
                if (num >= 3) {
                    del++;
                    score += num*val;
                    for (int j = 0; j < 5; j++) {
                        if (board[i][j] == val) board[i][j] = -1;
                    }
                }
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < 5; j++) {
                    if (board[i][j] == -1) {
                        while (board[i][j] == -1) {
                            for (int k = i; k < H; k++) {
                                board[k][j] = board[k+1][j];
                            }
                        }
                    }
                }
            }
            H -= del;

        } while (del > 0);

        cout << score << endl;

    }
    return 0;
}