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<set>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#include<sstream>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define ALL(c) (c).begin(), (c).end()
#define dump(a) cerr << #a << "=" << (a) << endl
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class T> void chmin(T &t, T f) { if (t > f) t = f; } //t=min
template<class T> void chmax(T &t, T f) { if (t < f) t = f; } //t=max
using namespace std;


int N;
int puzzle[5][11];

int deletePuzzle()
{
	int get_p = 0;

	/*
	cout << "---- remove start ----" << endl;
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	cout << endl;
	*/

	rep(y,N) {
		int back_p = 0;
		int the_p = 0;
		set<int> remove_xs;

		//3つ以上一致しているかを見る
		rep(x,5)
		{
			if (puzzle[x][y] == back_p && puzzle[x][y] > 0)
			{
				/*
				cout << "---------------" << endl;
				for (set<int>::iterator iti = remove_xs.begin(); iti != remove_xs.end(); iti++) { cout << *iti; }
				cout << endl;
				*/

				remove_xs.insert(x-1); //重複していたら挿入しない
				remove_xs.insert(x);
				if (remove_xs.size() >= 3) { //3回以上
					the_p = puzzle[x][y];
				}
			}
			else {
				//玉が異なっていて，既に3つ以上揃っているとき，これ以上は揃わないのでbreak;
				if (remove_xs.size() >= 3) {
					break;
				}
				else {
					remove_xs.clear();
				}
			}
			back_p = puzzle[x][y];
		}

		if (remove_xs.size() >= 3)
		{ 
			get_p += the_p * remove_xs.size(); //ポイント換算
			for (set<int>::iterator it = remove_xs.begin(); it != remove_xs.end(); it++) {
				puzzle[(*it)][y] = 0;
			}
		} 

	}

	/*
	cout << "---- remove end ----" << endl;
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	cout << endl;
	*/


	return get_p;
}

void dropPuzzle()
{
	rep(x,5) {
		vector<int> real_ps;
		rep(y,N) {
			if (puzzle[x][y] > 0) { real_ps.push_back(puzzle[x][y]); } //点数を吸い取る
			puzzle[x][y] = 0; //全部一回削除
		}
		int the_N = real_ps.size();
		rep(y,the_N) { //the_N分たどる
			puzzle[x][y+(N-the_N)] = real_ps[y];
		}
	}
	
	//デバッグ
	/*
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	*/
}

int main()
{
	int all_p;
	while(true) {
		cin >> N;
		all_p = 0;

		if (N == 0) { break; }
		rep(y,11) {
			rep(x,5) {
				puzzle[x][y] = 0;
			}
		}

		rep(y,N) {
			rep(x,5) {
				cin >> puzzle[x][y];
			}
		}

		/*
		rep(y,N) {
			rep(x,5) {
				cout << puzzle[x][y];
			}
			cout << endl;
		}
		cout << endl;
		*/

		//while get_p=0まで
		while(true) {
			int get_p = deletePuzzle();
			if (get_p == 0) { break; }
			all_p += get_p;
			dropPuzzle();
			//cout << endl;
		}

		cout << all_p << endl;
		//cout << endl;
	}
	return 0;
}

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

int h, w = 5;
int t[10][5];

int checkAndDelete(int x, int y){
  int tx = x;
  while(tx < w && t[y][tx] == t[y][x]) tx++;
  if(tx - x < 3) return 0;

  int res = 0;
  for(int j = x; j < tx; j++){
    res += t[y][j];
    t[y][j] = 0;
  }
  return res;
}

void burokkuOtosu(){
  for(int i = h - 1; i >= 0; i--){
    for(int j = 0; j < w; j++){
      if(t[i][j] == 0) continue;

      int ti;
      for(ti = i + 1; ti < h; ti++){
        if(t[ti][j] != 0) break;
      }
      ti--;
      if(i != ti){
        t[ti][j] = t[i][j];
        t[i][j] = 0;
      }
    }
  }
}

void solve(){
  int res = 0;

  while(true){
    bool changeFlg = false;

    for(int i = h - 1; i >= 0; i--){
      for(int j = 0; j < 3; j++){
        if(t[i][j] == 0) continue;

        int tmp = checkAndDelete(j, i);
        res += tmp;
        if(tmp){
          changeFlg = true;
          break;
        }
      }
    }

    burokkuOtosu();

    if(!changeFlg) break;
  }

  cout << res << endl;
}

int main(){
  while(cin >> h, h){
    for(int i = 0; i < h; i++){
      for(int j = 0; j < w; j++){
        cin >> t[i][j];
      }
    }
    solve();
  }
}