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>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

int jera(int H,int **C)
{
	for(int i=0;i<H;i++){
		if(C[i][0]==C[i][1]){
			if(C[i][1]==C[i][2]){
				if(C[i][2]==C[i][3]){
					if(C[i][3]==C[i][4]){
						C[i][0]
							=C[i][1]
							=C[i][2]
							=C[i][3]
							=C[i][4] =0;
					} else {
						C[i][0]
							=C[i][1]
							=C[i][2]
							=C[i][3] =0;
					}
				} else {
					C[i][0]
						=C[i][1]
						=C[i][2] =0;
				}
			} else {
				if((C[i][2]==C[i][3])&&(C[i][3]==C[i][4])){
					C[i][2] =C[i][3] =C[i][4] =0;
				}
			}
		} else {
			if(C[i][1]==C[i][2]){
				if(C[i][2]==C[i][3]){
					if(C[i][3]==C[i][4]){
						C[i][1]
							=C[i][2]
							=C[i][3]
							=C[i][4] =0;
					} else {
						C[i][1]=C[i][2]=C[i][3]=0;
					}
				}
			} else {
				if((C[i][2]==C[i][3])&&(C[i][3]==C[i][4])){
					C[i][2] =C[i][3] =C[i][4] =0;
				}
			}
		}
	}
	return 0;
}

int jfal(int H,int **C)
{
	int flag=0;
	for(int i=0;i<H;i++){
		for(int j=0;j<5;j++){
			if(C[i][j]==0){
				for(int k=i;k>0;k--){
					if(C[k-1][j]!=0)flag=1;
					C[k][j]=C[k-1][j];
				}
				C[0][j]=0;
			}
		}
	}
	return flag;
}

int main()
{
	while(1){
		int H;
		cin >> H;
		if(H==0)break;
		int **C;
		C=(int**)malloc(sizeof(int*)*H);
		int sum=0;
		for(int i=0;i<H;i++){
			C[i]=(int*)malloc(sizeof(int)*5);
			for(int j=0;j<5;j++){ cin >> C[i][j]; sum+=C[i][j]; }
		}
		do{
			jera(H,C);
		}while(jfal(H,C));

		for(int i=0;i<H;i++){
			for(int j=0;j<5;j++){ sum-=C[i][j]; }
		}
		cout << sum << endl ;
		for(int i=0;i<H;i++){
			free(C[i]);
		} free(C);
	}

	return 0;
}

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

    int H;
    int P[10][5]; //パズル
    int score; //総得点
    int check; //連続した玉があるか

void renzoku_check() 
{
    for (int i = 0; i < H; i++) {
        if ((P[i][0] == P[i][1]) && (P[i][0] == P[i][2]) && (P[i][0] != P[i][3]) && (P[i][0] != 0)) {
            score += 3*P[i][0];
            P[i][0] = 0;
            P[i][1] = 0;
            P[i][2] = 0;
            check = 1;
        }
        if ((P[i][0] == P[i][1]) && (P[i][0] == P[i][2]) && (P[i][0] == P[i][3]) && (P[i][0] != P[i][4]) && (P[i][0] != 0)) {
            score += 4*P[i][0];
            P[i][0] = 0;
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            check = 1;
        }
        if ((P[i][0] == P[i][1]) && (P[i][0] == P[i][2]) && (P[i][0] == P[i][3]) && (P[i][0] == P[i][4]) && (P[i][0] != 0)) {
            score += 5*P[i][0];
            P[i][0] = 0;
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            P[i][4] = 0;
            check = 1;
        }
        if ((P[i][1] == P[i][2]) && (P[i][1] == P[i][3]) && (P[i][0] != P[i][2]) && (P[i][4] != P[i][2]) && (P[i][1] != 0)) {
            score += 3*P[i][1];
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            check = 1;
        }
        if ((P[i][1] == P[i][2]) && (P[i][1] == P[i][3]) && (P[i][1]== P[i][4]) && (P[i][0] != P[i][1]) && (P[i][1] != 0)) {
            score += 4*P[i][1];
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            P[i][4] = 0;
            check = 1;
        }
        if ((P[i][2] == P[i][3]) && (P[i][2] == P[i][4]) && (P[i][1] != P[i][2]) && (P[i][2] != 0)) {
            score += 3*P[i][2];
            P[i][2] = 0;
            P[i][3] = 0;
            P[i][4] = 0;
            check = 1;
        }
    }
}

void drow()
{
    for (int i = 1; i < H; i++) {
        for (int j = 0; j < 5; j++) {
            if (P[i][j] == 0) {
                for (int k = i; k > 0; k--) {
                    P[k][j] = P[k-1][j];
                }
                P[0][j] = 0;
            }
        }
    }
}

int main()
{
    while(1)
    {
        cin >> H;
        if (H == 0) {
            break;
        }
        for (int i = 0; i < H; i++) { //パズル初期化
            for (int j = 0; j < 5; j++) {
                cin >> P[i][j];
            }
        }
        score = 0;

        while(1)
        {
            check = 0;
            renzoku_check();
            if (check == 0) break;
            drow();
        }
        
        cout << score << endl;


    }
}