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;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;


int main() {

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

        int P[H][5] = {};
        rep(i, H) rep(j, 5) cin >> P[i][j];

        int score = 0;
        bool can_vanish = true;

        while (can_vanish) {
            can_vanish = false;
            rep(i, H) {
                int p0 = P[i][0], p1 = P[i][1], p2 = P[i][2], p3 = P[i][3], p4 = P[i][4];

                if ((p0==p1) && (p1==p2) && (p2!=p3)) {
                    if (P[i][2] != 0) can_vanish = true;
                    score += P[i][2] * 3;
                    P[i][0] = P[i][1] = P[i][2] = 0;
                } else if ((p0!=p1) && (p1==p2) && (p2==p3) && (p3!=p4)) {
                    if (P[i][2] != 0) can_vanish = true;
                    score += P[i][2] * 3;
                    P[i][1] = P[i][2] = P[i][3] = 0;
                } else if ((p1!=p2) && (p2==p3) && (p3==p4)) {
                    if (P[i][2] != 0) can_vanish = true;
                    score += P[i][2] * 3;
                    P[i][2] = P[i][3] = P[i][4] = 0;
                } else if ((p0==p1) && (p1==p2) && (p2==p3) && (p3!=p4)) {
                    if (P[i][2] != 0) can_vanish = true;
                    score += P[i][2] * 4;
                    P[i][0] = P[i][1] = P[i][2] = P[i][3] = 0;
                } else if ((p0!=p1) && (p1==p2) && (p2==p3) && (p3==p4)) {
                    if (P[i][2] != 0) can_vanish = true;
                    score += P[i][2] * 4;
                    P[i][1] = P[i][2] = P[i][3] = P[i][4] = 0;
                } else if ((p0==p1) && (p1==p2) && (p2==p3) && (p3==p4)) {
                    if (P[i][2] != 0) can_vanish = true;
                    score += P[i][2] * 5;
                    P[i][0] = P[i][1] = P[i][2] = P[i][3] = P[i][4] = 0;
                }
            }

            rep(j, 5) {
                int i=H-1;
                while (i>0) {
                    int cnt = 0;
                    while ((P[i][j] == 0) && (cnt<=H)) {
                        for (int h=i; h>=1; h--) P[h][j] = P[h-1][j];
                        P[0][j] = 0;
                        cnt++;
                    } 
                    i--;
                }
            }
        }

        cout << score << endl;

    }

    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    
    while (scanf("%d", &n) && n){
        int blk[16][8];
        int ch[16][8];
        for (int i = 0; i < n; i++){
            for (int j = 0; j < 5; j++){
                scanf("%d", &blk[i][j]);
            }
        }
        
        int tot = 0;
        bool upd;
        
        do {
            upd = 0;
            memset(ch, 0, sizeof(ch));
            for (int i = 0; i < n; i++){
                for (int j = 0; j < 3; j++){
                    if (!blk[i][j]) continue;
                    if (blk[i][j] == blk[i][j + 1] && blk[i][j] == blk[i][j + 2]){
                        ch[i][j] = ch[i][j + 1] = ch[i][j + 2] = 1;
                        upd = true;
                    }
                }
            }
            int btm[8] = {0};
            for (int i = n - 1; i >= 0; i--){
                for (int j = 0; j < 5; j++){
                    tot += blk[i][j] * ch[i][j];
                    if (!ch[i][j]) blk[n - ++btm[j]][j] = blk[i][j];
                }
            }
            for (int i = 0; i < 5; i++){
                for (int j = 0; j < n - btm[i]; j++) blk[j][i] = 0;
            }
        } while (upd);
        
        printf("%d\n", tot);
    }
    
    return (0);
}