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;
typedef long long ll;
ll ban[100][10];;
ll rui[100][10];
ll kazu[6];
ll i,j,h;
ll ans,bans;
string S;
bool solve(){
	cin >> h;
	if(h == 0)return false;
	ans = 0;
	bans = 0;
	h += 5;
	for(i=5;i<h;i++){
		for(j=0;j<5;j++){
			cin >> ban[i][j];
		}
	}
	for(i=h;i<=h+10;i++){
		for(j=0;j<5;j++){
			ban[i][j] = 0;
		}
	}
	for(i=0;i<5;i++){
		for(j=0;j<5;j++){
			ban[i][j] = 0;
		}
	}
	bool flag = false;
	while(1){
		//cout << "-----" << endl;
		for(i=0;i<h;i++){
			for(j=0;j<5;j++){
				//cout << ban[i][j] << " ";
			}
			//cout << endl;
		}

		//cout << "-----" << endl;
		for(i=h-1;i>=0;i--){
			if(ban[i][0] == ban[i][1] && ban[i][1] == ban[i][2] && ban[i][0] != 0){
				if(ban[i][0] == ban[i][3]){
					if(ban[i][0] == ban[i][4]){
						ans += ban[i][0] + ban[i][1] + ban[i][2] + ban[i][3] + ban[i][4];
						ban[i][0] = 0;
						ban[i][1] = 0;
						ban[i][2] = 0;
						ban[i][3] = 0;
						ban[i][4] = 0;
					}else{

						ans += ban[i][0] + ban[i][1] + ban[i][2] + ban[i][3];
						ban[i][0] = 0;
						ban[i][1] = 0;
						ban[i][2] = 0;
						ban[i][3] = 0;
					}
				}else{
					ans += ban[i][0] + ban[i][1] + ban[i][2];
					ban[i][0] = 0;
					ban[i][1] = 0;
					ban[i][2] = 0;
				}
			}else if(ban[i][1] == ban[i][2] && ban[i][2] == ban[i][3] && ban[i][1] != 0){
				if(ban[i][1] == ban[i][4]){

					ans += ban[i][1] + ban[i][2] + ban[i][3] + ban[i][4];
					ban[i][1] = 0;
					ban[i][2] = 0;
					ban[i][3] = 0;
					ban[i][4] = 0;
				}else{

					ans += ban[i][1] + ban[i][2] + ban[i][3];
					ban[i][1] = 0;
					ban[i][2] = 0;
					ban[i][3] = 0;
				}	
			}else if(ban[i][2] == ban[i][3] && ban[i][3] == ban[i][4] && ban[i][2] != 0){

				ans += ban[i][2] + ban[i][3] + ban[i][4];
				ban[i][2] = 0;
				ban[i][3] = 0;
				ban[i][4] = 0;
			}
		}
		if(bans == ans)break;
		for(int num = 0; num <= 15; num ++){
		for(i=h-1;i>=1;i--){
			for(j=0;j<5;j++){
				if(ban[i][j] == 0){
					swap(ban[i][j],ban[i-1][j]);
				}
			}
		}}
		bans = ans;
	}
	cout << ans << endl;
	return true;
}

int main(){
	while(solve()){}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int mp[10][5];
int main() {
  while (true) {
    int h;
    cin >> h;
    if (h == 0)
      break;
    for (int i = 0; i < 10; i++)
      for (int j = 0; j < 5; j++)
        mp[i][j] = 0;
    for (int i = h - 1; i >= 0; i--)
      for (int j = 0; j < 5; j++)
        cin >> mp[i][j];
    bool found = true;
    int score = 0;
    while (found) {
      found = false;
      for (int i = 0; i < 10; i++) {
        int bg = 0;
        for (int j = 1; j < 5; j++) {
          if (mp[i][j] != mp[i][bg]) {
            if (j - bg >= 3 && mp[i][bg] != 0) {
              found = true;
              for (int k = bg; k < j; k++) {
                score += mp[i][k];
                mp[i][k] = 0;
              }
            }
            bg = j;
          }
        }
        if (bg <= 2 && mp[i][bg] != 0) {
          found = true;
          for (int k = bg; k < 5; k++) {
            score += mp[i][k];
            mp[i][k] = 0;
          }
        }
      }
      for (int j = 0; j < 5; j++) {
        int t[10], p = 0;
        for (int i = 0; i < 10; i++)
          t[i] = 0;
        for (int i = 0; i < 10; i++)
          if (mp[i][j] != 0)
            t[p++] = mp[i][j];
        for (int i = 0; i < 10; i++)
          mp[i][j] = t[i];
      }
    }
    cout << score << endl;
  }
}

C++: #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,N,n) for(int i=N;i>=n;i++)
#define CH(n,a,b) (a)<=(n)&&(n)<(b)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;

int main() {
	int H;
	while(cin>>H,H){
		int field[12][5];
		bool flag[12][5];
		int ans=0;
		REP(j,0,5) field[0][j]=-1;
		REP(i,1,H+1) REP(j,0,5) cin>>field[i][j];
		bool ok=true;
		while(ok){
			REP(i,0,12) REP(j,0,5) flag[i][j]=false;
			ok=false;
			REP(i,1,H+1){
				int prev=0,tmp=1;
				REP(j,0,5){
					if(field[i][j]==-1){
						prev=-1;
						tmp=1;
						continue;
					}
					if(field[i][j]==prev){
						tmp++;
						if(j==4&&tmp>2){
							ok=true;
							ans+=prev*tmp;
							for(int k=4;k>j-tmp;k--) flag[i][k]=true;
							break;
						}
					}
					else{
						if(tmp<3) {
							prev=field[i][j];
							tmp=1;
						}
						else{
							ok=true;
							ans+=prev*tmp;
							for(int k=j-1;k>=j-tmp;k--) flag[i][k]=true;
							break;
						}
					}
				}
			}
			REP(i,1,H+1){
				REP(j,0,5){
					if(flag[i][j]) {
						for(int k=i;(k>0&&field[k][j]!=-1);k--)field[k][j]=field[k-1][j];
					}
				}
			}
		}
		p(ans);
	}
	return 0;
}