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++: //Name: Chain Disappearance Puzzle
//Level: 2
//Category: シミュレーション
//Note:

/**
 * 素直にシミュレーションすればよい。
 * 消える石にマークする処理と、消えたところに石を詰める処理は別々に行わないといけないことに注意する。
 *
 * オーダーは O(H^2)。
 */
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

void mark(vector<vector<int>> &field, int r, int c, int cnt) {
    for(int cc = c-cnt+1; cc <= c; ++cc) {
        field[r][cc] = 0;
    }
}

int sim(vector<vector<int>> &field) {
    const int H = field.size();
    int score = 0;
    for(int r = 0; r < H; ++r) {
        int cnt = 0;
        int prev = -1;
        for(int c = 0; c < 5; ++c) {
            if(field[r][c] == prev) {
                ++cnt;
            } else {
                if(cnt >= 3 && prev != 0) {
                    score += cnt;
                    mark(field, r, c-1, cnt);
                }
                cnt = 1;
            }
            prev = field[r][c];
        }
        if(cnt >= 3 && prev != 0) {
            score += cnt;
            mark(field, r, 4, cnt);
        }
    }
    if(score > 0) {
        for(int r = H-1; r >= 0; --r) {
            for(int c = 0; c < 5; ++c) {
                if(field[r][c] == 0) {
                    for(int rr = r-1; rr >= 0; --rr) {
                        if(field[rr][c] != 0) {
                            field[r][c] = field[rr][c];
                            field[rr][c] = 0;
                            break;
                        }
                    }
                }
            }
        }
    }
    return score;
}

bool solve() {
    int H;
    if(!(cin >> H)) return false;
    if(!H) return false;

    vector<vector<int>> field(H);
    for(int i = 0; i < H; ++i) {
        for(int j = 0; j < 5; ++j) {
            int v;
            cin >> v;
            field[i].push_back(v);
        }
    }

    int ans = 0;
    while(true) {
        const int score = sim(field);
        if(score == 0) break;
        ans += score;
    }
    cout << ans << endl;
    return true;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    while(solve()) ;
    return 0;
}

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

int main() {
    while (true) {
        int H;
        cin >> H;
        if (H == 0) break;
        vector<vector<int>> P(H, vector<int>(5));
        for (int i = 0; i < H; ++i) cin >> P[i][0] >> P[i][1] >> P[i][2] >> P[i][3] >> P[i][4];
        
        int score = 0;
        while (true) {
            // 消えるかどうか判定
            vector<vector<bool>> D(H, vector<bool>(5));
            bool judge = false;
            for (int i = 0; i < H; ++i) {
                for (int j = 0; j < 3; ++j) {
                    if (P[i][j] == P[i][j + 1] && P[i][j + 1] == P[i][j + 2] && P[i][j] != 0) {
                        judge = true;
                        D[i][j] = true;
                        D[i][j + 1] = true;
                        D[i][j + 2] = true;
                    }
                }
            }
            if (!judge) break;
            
            // 消す
            for (int i = 0; i < H; ++i) {
                for (int j = 0; j < 5; ++j) {
                    if (D[i][j]) {
                        score += P[i][j];
                        P[i][j] = 0;
                    }
                }
            }
            
            // 落とす
            for (int i = 0; i < H; ++i) {
                for (int j = 0; j < H - 1; ++j) {
                    for (int k = 0; k < 5; ++k) {
                        if (P[j + 1][k] == 0) {
                            P[j + 1][k] = P[j][k];
                            P[j][k] = 0;
                        }
                    }
                }
            }
        }
        
        cout << score << endl;
    }
    return 0;
}