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>
#include <queue>
#include <cstring>

using namespace std;

int h;
int map[10][6];
bool checked[10][5];

/*
int check(int x,int y,int num,int count){
  if(x > 4)
    return count;
  
  if(num != map[y][x])
    return count;

  if(count > 5)
    return count;

  if(num == 0)
    return count;
  
  checked[y][x] = true;
  return check(x+1,y,map[y][x],count+1);
}
*/
int main(){

  while(cin>>h){
    if(h == 0)
      break;

    memset(map,0,sizeof(map));
    memset(checked,false,sizeof(checked));

    
    for(int i = 10-h;i<10;i++){
      for(int j = 0;j<5;j++){
	cin>>map[i][j];
      }
    }

    int point = 0;
    bool update = true;
    /*
    for(int i = 0;i<10;i++){
      for(int j = 0;j<5;j++){
	cout<<map[i][j]<<"\t";
      }
      cout<<endl;
    }
    */
    while(update){
      update = false;
      //memset(checked,false,sizeof(checked));
      for(int i = 10-h;i < 10;i++){
	int tmp = 1;
	for(int j = 1;j<6;j++){
	  if(j != 5 && map[i][j] == 0)
	    continue;
	  if(map[i][j] == map[i][j-1]){
	    tmp++;
	  }else if(tmp >= 3){
	    point += tmp * map[i][j-1];

	    update = true;
	    for(int k = j-tmp;k<j;k++){
	      for(int l = i;l > 0;l--){
		map[l][k] = map[l-1][k];
	      }
	    }
	    tmp = 0;
	  }else{
	    tmp = 1;
	  }

	}
      }
      /*
      cout<<"--------------------------"<<endl;

    for(int i = 0;i<10;i++){
      for(int j = 0;j<5;j++){
	cout<<map[i][j]<<"\t";
      }
      cout<<endl;
      }

      */
    }
    cout<<point<<endl;
  }
    
	
  return 0;
}

C++: #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int H;
int fld[5][10];
void drop(){
      bool pp;
      REP(i,5){
            REP(j,H){
                  if(fld[i][j]==-1){
                        for(int k=j;k<H;k++){
                              if(fld[i][k]!=-1){
                                    swap(fld[i][k],fld[i][j]);
                                    break;
                              }
                        }
                  }
            }
      }
}
int main(){
      while(cin>>H&&H){
            for(int i=H-1;i>=0;i--)REP(j,5)cin>>fld[j][i];
            bool update=true;
            int ans=0;
            while(update){
                  update=false;
                  REP(i,H){
                        int s,e,j=0;bool change=false;
                        while(j<5){
                              if(fld[j][i]==-1){
                                    j++;
                                    continue;
                              }
                              s=j;
                              while(fld[s][i]==fld[j][i])j++;
                              if(j-s>=3){
                                    e=j;
                                    change=true;
                                    break;
                              }
                        }
                        if(change){
                              update=true;
                              ans+=(e-s)*fld[s][i];
                              for(int j=s;j<e;j++)fld[j][i]=-1;
                        }
                  }
                  drop();
            }
            cout<<ans<<endl;
      }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define reps(i,j,k) for(int i=j;i<k;++i)
#define rep(i,j) reps(i,0,j)
int stage[12][12];
int W,H;
int check(){
	int prev = -1;
	int cnt = 0;
	int res = 0;
	rep(i,H){
		rep(j,W){
			if(prev != stage[i][j] || prev == 0){
				if(cnt >= 3){
					res += stage[i][j-1]*cnt;
					reps(k,j-cnt,j){
						stage[i][k] = 0;
					}
				}
				prev = stage[i][j];
				cnt = 1;
			}
			else{
				cnt++;
			}
		}
		if(cnt >= 3){
			res += stage[i][W-1]*cnt;
			reps(k,W-cnt,W){
				stage[i][k] = 0;
			}
		}
		cnt = 0;
		prev = -1;
	}
	return res;
}

void drop(){
	rep(i,H-1){
		rep(j,W){
			int c = i;
			while(stage[i][j] == 0){
				if(c == H)break;
				reps(k,i+1,H){
					stage[k-1][j] = stage[k][j];
				}
				stage[H-1][j] = 0;
				c++;
			}
		}
	}
}

int main(){
	W = 5;
	while(scanf("%d",&H),H){
		rep(i,12){
			rep(j,12){
				stage[i][j] = 0;
			}
		}
		rep(i,H){
			rep(j,W){
				scanf("%d",&stage[H-i-1][j]);
			}
		}

		int score = 0;
		while(true){
			int tmp = check();
			/*puts("**************");
			rep(i,H){
				rep(j,W){
					printf("%d",stage[i][j]);
				}
				puts("");
			}*/
			if(tmp == 0)break;
			score += tmp;
			drop();
		}	
		printf("%d\n",score);
	}
	return 0;
}