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 <string>
#include <vector>
using namespace std;

bool drop(vector<vector<int>> &v_v);
int caluculate_score_of_line(vector<int> &v, int bidx, int eidx);
int apply_to_line(vector<int> &v);
int apply_to_lines(vector<vector<int>> &v_v);
void disp_v(vector<int> &v);
void disp_v_v(vector<vector<int>> &v_v);

bool drop(vector<vector<int>> &v_v) {
    int drop_count = 0;
    for (int j=0; j<5; j++) {
        for (int i=v_v.size()-1; i>-1; i--) {
            if (v_v[i][j] == 0) {
                int above_idx = i - 1;
                while (above_idx>=0) {
                    if (v_v[above_idx][j] > 0) {
                        v_v[i][j] = v_v[above_idx][j];
                        v_v[above_idx][j] = 0;
                        drop_count ++;
                        break;
                    }
                    above_idx--;
                }
            }
        }
    }

    if (drop_count > 0) {
        // cout << "DROP" << endl;
        // disp_v_v(v_v);
        return true;
    } else {
        return false;
    }
}

int caluculate_score_of_line(vector<int> &v, int bidx, int eidx) {
    int score_of_element = v[bidx];
    for (int i=bidx; i<=eidx; i++) {
        v[i] = 0;
    }
    return score_of_element * (eidx-bidx+1);
}

int apply_to_line(vector<int> &v) {
    int bef = 0, bef_count = 0, bidx = 0;
    for (int i=0; i<v.size(); i++) {
        if ((bef!=0)&&((bef!=v[i])||(v[i]==0))) {
            if (bef_count>=3) {
                return caluculate_score_of_line(v, bidx, i-1);
            }
            bef_count = 0;
            bidx = i;
        }
        bef_count++;
        bef = v[i];
    }
    if (bef_count>=3) {
        return caluculate_score_of_line(v, bidx, v.size()-1);
    }
    return 0;
}

int apply_to_lines(vector<vector<int>> &v_v) {
    int score_of_lines = 0;
    for (int i=0; i<v_v.size(); i++) {
        score_of_lines += apply_to_line(v_v[i]);
    }
    return score_of_lines;
}

void disp_v(vector<int> &v) {
    for (int i=0; i<v.size(); i++) {
        cout << v[i] << " ";
    }
    cout << endl;
}

void disp_v_v(vector<vector<int>> &v_v) {
    for (int i=0; i<v_v.size(); i++) {
        disp_v(v_v[i]);
    }
}

int main() {
    int i, j, n, tmp;
    string s;
    while ((cin >> n) && (n != 0)) {
        int ans = 0;
        vector<vector<int>> v_v;
        for (i=0; i<n; i++) {
            vector<int> v;
            for (j=0; j<5; j++) {
                cin >> tmp;
                v.push_back(tmp);
            }
            v_v.push_back(v);
        }
        // disp_v_v(v_v);
        ans += apply_to_lines(v_v);
        // disp_v_v(v_v);
        while (drop(v_v)) {
            ans += apply_to_lines(v_v);
            // disp_v_v(v_v);
        }
        cout << ans << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <cstdio>

using namespace std;

int main() {
	int H;
	cin >> H;
	if (!H) {
		return 0;
	}
	vector< vector<int> > b(H, vector<int>(6));
	for (int i = 0; i < H; i++) {
		cin >> b[i][0] >> b[i][1] >> b[i][2] >> b[i][3] >> b[i][4];
		b[i][5] = 0;
	}
	int ans = 0;
	int score = -1;
	while (score) {
		score = 0;
		for (int i = 0; i < H; i++) {
			int prev = b[i][0];
			int index = 0;
			int length = 1;
			for (int j = 1; j <= 5; j++) {
				if (b[i][j] == prev) {
					length++;
				} else {
					if (length >= 3) {
						score += prev * length;
						for (int k = index; k < index + length; k++) {
							b[i][k] = 0;
						}
					}
					prev = b[i][j];
					index = j;
					length = 1;
				}
			}
		}
		vector< vector<int> > t(H, vector<int>(6, 0));
		for (int j = 0; j < 5; j++) {
			for (int i = H, k = H - 1; i--;) {
				if (b[i][j]) {
					t[k][j] = b[i][j];
					k--;
				}
			}
		}
		ans += score;
		b = t;
	}
	cout << ans << endl;
	return main();
}