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;

int main(){
    int h;
    while(1){
        cin >> h;
        if(h==0) break;
        vector<vector<int>> V(5, vector<int>(2*h,-1));
        for(int i=0; i<h; i++){
            cin >> V[0][h-1-i] >> V[1][h-1-i] >> V[2][h-1-i] >> V[3][h-1-i] >> V[4][h-1-i];
        }

        // cout << "==============" << endl;
        // for(int i=0; i<5; i++){
        //     for(int j=0; j<2*h; j++){
        //         cout << V[i][j];
        //     }
        //     cout << endl;
        // }
        
        int score = 0;
        // 最大hステップ
        for(int t=0; t<h; t++){
            // 各ステップで点数を計算
            for(int row=0; row<h; row++){
                // ある行で消えるものを見つける
                if(V[0][row] == V[1][row] and V[1][row] == V[2][row] and V[2][row] == V[3][row] and V[3][row] == V[4][row]){
                    if(V[0][row]==-1) continue;
                    score+=V[0][row]*5;
                }
                else if(V[0][row] == V[1][row] and V[1][row] == V[2][row] and V[2][row] == V[3][row]){
                    if(V[0][row]==-1) continue;
                    score+=V[0][row]*4;
                }
                else if(V[1][row] == V[2][row] and V[2][row] == V[3][row] and V[3][row] == V[4][row]){
                    if(V[1][row]==-1) continue;
                    score+=V[1][row]*4;
                }
                else if(V[0][row] == V[1][row] and V[1][row] == V[2][row]){
                    if(V[0][row]==-1) continue;
                    score+=V[0][row]*3;
                }   
                else if(V[1][row] == V[2][row] and V[2][row] == V[3][row]){
                    if(V[1][row]==-1) continue;
                    score+=V[1][row]*3;
                }
                else if(V[2][row] == V[3][row] and V[3][row] == V[4][row]){
                    if(V[2][row]==-1) continue;
                    score+=V[2][row]*3;
                }
            }
            // 盤面を更新
            for(int row=h-1; row>=0; row--){
                // ある行で消えるものを見つける
                if(V[0][row] == V[1][row] and V[1][row] == V[2][row] and V[2][row] == V[3][row] and V[3][row] == V[4][row]){
                    if(V[0][row]==-1) continue;
                    // cout << "1" << endl;
                    V[0].erase(V[0].begin()+row), V[0].push_back(-1);
                    V[1].erase(V[1].begin()+row), V[1].push_back(-1);
                    V[2].erase(V[2].begin()+row), V[2].push_back(-1);
                    V[3].erase(V[3].begin()+row), V[3].push_back(-1);
                    V[4].erase(V[4].begin()+row), V[4].push_back(-1);
                }
                else if(V[0][row] == V[1][row] and V[1][row] == V[2][row] and V[2][row] == V[3][row]){
                    if(V[0][row]==-1) continue;
                    V[0].erase(V[0].begin()+row), V[0].push_back(-1);
                    V[1].erase(V[1].begin()+row), V[1].push_back(-1);
                    V[2].erase(V[2].begin()+row), V[2].push_back(-1);
                    V[3].erase(V[3].begin()+row), V[3].push_back(-1);
                }
                else if(V[1][row] == V[2][row] and V[2][row] == V[3][row] and V[3][row] == V[4][row]){
                    if(V[1][row]==-1) continue;
                    V[1].erase(V[1].begin()+row), V[1].push_back(-1);
                    V[2].erase(V[2].begin()+row), V[2].push_back(-1);
                    V[3].erase(V[3].begin()+row), V[3].push_back(-1);
                    V[4].erase(V[4].begin()+row), V[4].push_back(-1);
                }
                else if(V[0][row] == V[1][row] and V[1][row] == V[2][row]){
                    if(V[0][row]==-1) continue;
                    V[0].erase(V[0].begin()+row), V[0].push_back(-1);
                    V[1].erase(V[1].begin()+row), V[1].push_back(-1);
                    V[2].erase(V[2].begin()+row), V[2].push_back(-1);
                }   
                else if(V[1][row] == V[2][row] and V[2][row] == V[3][row]){
                    if(V[1][row]==-1) continue;
                    V[1].erase(V[1].begin()+row), V[1].push_back(-1);
                    V[2].erase(V[2].begin()+row), V[2].push_back(-1);
                    V[3].erase(V[3].begin()+row), V[3].push_back(-1);
                }
                else if(V[2][row] == V[3][row] and V[3][row] == V[4][row]){
                    if(V[2][row]==-1) continue;
                    V[2].erase(V[2].begin()+row), V[2].push_back(-1);
                    V[3].erase(V[3].begin()+row), V[3].push_back(-1);
                    V[4].erase(V[4].begin()+row), V[4].push_back(-1);
                }
            }
        }

        // 盤面を確認
        // cout << "==============" << endl;
        // for(int i=0; i<5; i++){
        //     for(int j=0; j<2*h; j++){
        //         cout << V[i][j];
        //     }
        //     cout << endl;
        // }

        // cout << "score: " << score << endl;
        cout << score << endl;
    }
}