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"
#define rep(i,a,n) for(int i=a;i<n;i++)
using namespace std;
using ll=long long;
const int M=100010;

int x[12][5];
int erase(){	//まず、全体を見る.消去する数字を0にして、総得点を出力;
	int a=2,ans=0,tmp;
	rep(h,0,12){
		rep(i,0,3){
			if(x[h][i]&&x[h][i]==x[h][i+1]&&x[h][i+1]==x[h][i+2])
				tmp=x[h][i],a++;
		}
		if(a>2){
			rep(i,0,4)if(x[h][i]==tmp&&x[h][i]==x[h][i+1]){
				x[h][i]=0;
				if(i==3||x[h][i+1]!=x[h][i+2])x[h][i+1]=0;
			}
			ans+=a*tmp;
			a=2;
		}
	}
	return ans;
}
void fall(){	//上の段から探索し、一つ下の段が0なら落とす;
	for(int i=11;i!=0;i--){
		rep(j,0,5){
			if(x[i][j]!=0&&x[i-1][j]==0){
				x[i-1][j]=x[i][j];
				x[i][j]=0;
				if(x[i+1][j]!=0&&x[i][j]==0){
					i+=2,j=-1;
				}
			}
		}
	}
}


int main(){
	while(1){
		int h,ans=0;
		cin>>h;
		if(h==0)break;
		rep(i,0,12){
			rep(j,0,5)x[i][j]=0;
		}
		for(int i=h-1;i>=0;i--){
			rep(j,0,5)cin>>x[i][j];
		}
		int z=-1;
		while(z!=0){
			z=erase();
			ans+=z;
			fall();
//			for(int i=11;i>=0;i--)
//				rep(j,0,5){
//				cout<<x[i][j];
//				if(j==4)cout<<endl;
//			}
//
//			cout<<ans<<endl;
//			cout<<"--------------"<<endl;
		}
		cout<<ans<<endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int h;
  while(cin>>h,h){
    int a[10][5],ans=0;
    for(int i=0;i<h;i++)
      for(int j=0;j<5;j++)cin>>a[i][j];
    bool f=1;
    while(f){
      f=0;
      for(int i=0;i<h;i++){
	int c=1,p=0;
	for(int j=1;j<5;j++)
	  if(a[i][p]==a[i][j])c++;
	  else if(c<3)c=1,p=j;
	if(c>=3){
	  if(a[i][p]!=0)f=1;
	  ans+=c*a[i][p];
	  for(int j=0;j<c;j++)a[i][p+j]=0;
	}
      }
      for(int i=0;i<5;i++)
	for(int j=1;j<h;j++)
	  for(int k=j;k>0;k--)
	    if(!a[k][i]&&a[k-1][i])swap(a[k][i],a[k-1][i]);
    }
    cout<<ans<<endl;
  }
  return 0;
}

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

int h, d[10][5];

int check() {
  int counter = 0;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < 3; j++) {
      if (d[i][j] == -10) continue;
      if (d[i][j] == d[i][j + 1] && d[i][j] == d[i][j + 2]) {
        int num = d[i][j];
        for (int k = j; k < 5; k++) {
          if (d[i][k] == num) d[i][k] = -1, counter += num;
          else break;
        }
        break;
      }
    }
  }
  return counter;
}

void fall() {
  for (int j = 0; j < 5; j++) {
    int counter = 0, temp = 0;
    for (int i = h - 1; i >= 0; i--) {
      if (d[i][j] == -10) { temp = i; break; }
      if (d[i][j] == -1) counter++;
      else d[i + counter][j] = d[i][j];
    }
    for (int i = temp; i < counter; i++) d[i][j] = -10;
  }
}

int main() {
  while (1) {
    scanf("%d", &h);
    if (h == 0) break;
    for (int i = 0; i < h; i++) for (int j = 0; j < 5; j++) scanf("%d", &d[i][j]);
    int sum = 0;
    while (1) {
      int counter = check();
      if (counter == 0) break;
      sum += counter;
      fall();
    }
    printf("%d\n", sum);
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
// void pfield(vector<vector<int> >, int);

int main() {
  int cols;
  while(cin >> cols, cols) {
    vector<vector<int> > field(5, vector<int>()); // [col][line]
    for(int il = 0; il < cols; ++il) {
      for(int ic = 0; ic < 5; ++ic) {
        int num;
        cin >> num;
        field[ic].push_back(num);
      }
    }
    for(int ic = 0; ic < 5; ++ic) {
      reverse(field[ic].begin(), field[ic].end());
    }
    int score = 0;
    int lastScore = 0;
    do {
      lastScore = score;
      // Top down scan
      for(int il = cols; il >= 0; --il) {
        int rowCnt = 0;
        int lastNum = -1;
        for(int ic = 0; ic < 5; ++ic) {
          if(field[ic].size() <= il) {
            rowCnt = 0;
            continue;
          }
          (field[ic][il] == lastNum) ? ++rowCnt : (rowCnt = 0);
          int eraseNum = lastNum;
          lastNum = field[ic][il];
          if(rowCnt == 2) {
            for(int dic = -2; dic <= 0; ++dic) {
              field[ic + dic].erase(field[ic + dic].begin() + il);
              score += eraseNum;
            }
          } else if(rowCnt > 2) {
            field[ic].erase(field[ic].begin() + il);
            score += eraseNum;
          }
        }
      }
    } while(score != lastScore);
    cout << score << endl;
  }
  return 0;
}