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<algorithm>
using namespace std;
#define FOR(i, a, n) for(int i=a; i<n; i++)
#define RFOR(i, a, n) for(int i=n-1; i>=a; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define INF -100000

int main()
{
	int H;
	while (cin >> H, H) {
		int table[11][5];
		RFOR(i, H, 11) REP(j, 5) table[i][j] = -1;
		RFOR(i, 0, H) REP(j, 5) cin >> table[i][j];

		int ans = 0;
		bool changed = true;
		while (changed) {
			changed = false;

			REP(i, H) {
				int prev = 0;
				int chain = 1, ch = 1;
				int num = 0, jj = -1;
				REP(j, 5) {
					if (table[i][j] == -1 || table[i][j]==INF) {
						prev = 0;
						chain = 1;
						continue;
					}

					if (prev == table[i][j]) {
						chain++;
						if (chain >= 3) {
							num = table[i][j];
							jj = j;
							ch = chain;
						}
					}
					else chain = 1;

					prev = table[i][j];
				}

				chain = max(chain, ch);
				if (chain >= 3) {
					changed = true;

					ans += (num * chain);
					REP(cnt, chain) table[i][jj - cnt] = INF;
				}

			}

			REP(i, H) {
				REP(j, 5) {
					if (table[i][j] == -1) continue;
					else if (table[i][j] == INF) {
						int cnt = 1;
						while (i+cnt<11 && table[i + cnt][j] == INF) {
							cnt++;
						}
						if (i + cnt > 10) continue;
						table[i][j] = table[i + cnt][j];
						table[i + cnt][j] = INF;
					}
				}
			}
		}

		cout << ans << endl;
	}
	return 0;
}

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

int H;
int b[10][5];

struct range {
  int row;
  int left;
  int right;
};

void drop(int row, int col) {
  for (int i = row; i > 0; i--) {
    b[i][col] = b[i-1][col];
  }
  b[0][col] = -1;
}

void print_board() {
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < 5; j++) {
      cerr << b[i][j] << ' ';
    }
    cerr << endl;
  }
  cerr << endl;
}

void solve() {
  int ans = 0;
  while (1) {
    /* print_board(); */
    vector<range> deleted;
    for (int i = 0; i < H; i++) {
      int left = 0;
      for (int j = 1; j < 6; j++) {
        if (j == 5 || b[i][j] != b[i][j-1]) {
          if (j >= left + 3) {
            if (b[i][j-1] != -1) {
              range tmp = {i, left, j-1};
              deleted.push_back(tmp);
              ans += b[i][j-1] * (j - left);
            }
            break;
          } else {
            left = j;
          }
        }
      }
    }
    if (deleted.size() == 0) { break; }
    for (int k = 0; k < deleted.size(); k++) {
      range d = deleted[k];
      for (int j = d.left; j <= d.right; j++) {
        drop(d.row, j);
      }
    }
  }
  cout << ans << endl;
}

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 >> b[i][j];
      }
    }
    solve();
  }
}

C++: //今日の成果*AOJ0027*AOJ0028


#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(int x){stringstream ss;ss<<x;return ss.str();}
int main(){
	
	int h,ans=0;
	//while(cin>>h,h){
	ans=0;
	int ta[200][5]={{0},{0}};
	for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>ta[i][j];
	//盤面の存在しないところは0
	while(true){
	bool f=1;
	for(int i=0;i<h;i++){
	int cnt=0,fi=0;
		for(int j=0;j<3;j++){
			if(ta[i][j]==ta[i][j+1]&&ta[i][j]==ta[i][j+2]&&ta[i][j]!=0){
			cnt++;
			if(fi==0)fi=j;
			}
		}//endfor
		if(cnt!=0)ans+=ta[i][fi]*(2+cnt),f=0;
		if(cnt!=0)for(int j=0;j<2+cnt;j++)ta[i][fi+j]=0;
	}//endfor
	if(f)break;
	//落とす処理
	for(int i=h-2;i>=0;i--){
		for(int j=0;j<5;j++){
			int ti=i;
			while(true){
			if(ti==h-1||ta[ti+1][j]!=0)break;
			ta[ti+1][j]=ta[ti][j];
			ta[ti][j]=0;
			ti++;
			}//endwhile
		}//endfor
	}//endfor
	}//endwhile
	cout<<ans<<endl;
	//}//endwhile
	return 0;
}