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<queue>
using namespace std;

queue <int>que;
int mas[12][6];
int h;
int cheak;
int a,t;
int p;
int size;

int bfs(int y){
  int ans=0;
  if(mas[y][1]==mas[y][2] && mas[y][1]==mas[y][3]){
    ans=mas[y][2]*3;
    if(mas[y][0]==mas[y][1] && mas[y][1]==mas[y][4]){
      ans=mas[y][2]*5;
      mas[y][0]=0;
      mas[y][4]=0;
    }
    else if(mas[y][0]==mas[y][1]){
      ans=mas[y][2]*4;
      mas[y][0]=0;
    }
    else if(mas[y][4]==mas[y][1]){
      ans=mas[y][2]*4;
      mas[y][4]=0;
    }
    mas[y][1]=0;
    mas[y][2]=0;
    mas[y][3]=0;
  }

  else if(mas[y][0]==mas[y][1] && mas[y][0]==mas[y][2]){
    ans=mas[y][2]*3;
    mas[y][0]=0;
    mas[y][1]=0;
    mas[y][2]=0;
  }
  else if(mas[y][2]==mas[y][3] && mas[y][2]==mas[y][4]){
    ans=mas[y][2]*3;
    mas[y][2]=0;
    mas[y][3]=0;
    mas[y][4]=0;
  }

  return ans;
}


main(){
  while(cin >> h,h){
    a=0;
    for(int i=0;i<h;i++){
      for(int j=0;j<5;j++){
	cin >> mas[i][j];
      }
    }
    
    while(1){
      cheak=0;
      t=0;
      for(int i=0;i<h;i++){
	t=bfs(i);
	if(t!=0)cheak=1;
	a+=t;
      }

      if(cheak==0)break;

      for(int i=0;i<5;i++){
	int d=0;
	for(int j=0;j<h;j++){
	  if(mas[j][i]>0)que.push(mas[j][i]);
	}
	size=que.size();

	for(int j=0;j<h-size;j++){
	  mas[j][i]=0;
	} 
	for(int j=h-size;j<h;j++){
	  mas[j][i]=que.front();
	  que.pop();
	}
      }

    }
    cout << a << endl;
  }
}

C++: #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

int stone[11][5];
int H;
int remove_impl(int a) {
    int res=0;
    bool f[5]={};
    rep(i,5) {
        int t = stone[a][i];
        int j=i+1;
        while(j!=5) {
            if(t!=stone[a][j]) break;
            j++;
        }
        if(j-i>=3) {
            res += (j-i)*t;
            for(int k=i;k<j;k++) stone[a][k]=0;
        }
    }
    return res;
}

void pack() {
    for(int i=H-2;i>=0;i--) {
        for(int j=4;j>=0;j--) {
            int pos=i;
            while(stone[pos+1][j]==0&&pos!=H-1) pos++;
            if(pos!=i) {
                stone[pos][j]=stone[i][j];
                stone[i][j]=0;
            }
        }
    }
}

int remove() {
    int res=0;
    rep(i,H) res+=remove_impl(i);
    pack();
    return res;
}
void plot() {
    cout<<endl;
    rep(i,H) {
        rep(j,5) cout<<stone[i][j]<<" ";
        cout<<endl;
    }
}

void solve() {
    rep(i,11) rep(j,5) stone[i][j]=0;
    rep(i,H) rep(j,5) cin>>stone[i][j];
    int ans=0;
    int t;
    while(1) {
        t=remove();
        if(t==0) break;
        // plot();
        ans+=t;
    }
    cout<<ans<<endl;

}

int main() {
    while(cin>>H) {
        if(H==0) break;
        solve();
    }
    return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
while(1){
 int H;
 cin>>H;

 if(H==0)break;

 int S[10][5];
 for(int y=0;y<H;y++)
	for(int x=0;x<5;x++)
		cin>>S[y][x];

 int sco=0;
 
 while(1){
	bool flg=false;

	for(int y=0;y<H;y++){
		int m =S[y][2];//真ん中覚える
		if(m==0)
			continue;

		if(S[y][0]==m && S[y][1]==m){//012で消える
			sco+=m*3;
			S[y][0]=S[y][1]=S[y][2]=0;
			flg==true;
			if(S[y][3]==m){
				sco+=m;
				S[y][3]=0;
				if(S[y][4]==m){
					sco+=m;
					S[y][4]=0;
				}
			}
		}
		else if(S[y][1]==m&&S[y][3]==m){
			sco+=m*3;
			S[y][1]=S[y][2]=S[y][3]=0;
			flg=true;
			if(S[y][4]==m){
				sco+=m;
				S[y][4]=0;
			}
		}
		else if(S[y][3]==m&&S[y][4]==m){
			sco+=m*3;
			S[y][2]=S[y][3]=S[y][4]=0;
			flg=true;
		}
	}
	if(!flg)break;

	for(int x=0;x<5;x++){
		for(int y=H-1;y>=0;y--){
			if(S[y][x]=0)
				continue;
			for(int y2=y-2;y2>=0;y2--){
				if(S[y2][x]!=0){
					S[y][x]=S[y2][x]=0;
					break;
				}
			}
		}
	}
 }
 cout<<sco<<endl;
}
return 0;
}