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<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
 
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
 
 
using namespace std;
 
int MAP[10][5];
int h;
void fall(){
  rep(i,h){
    for(int i=h-1;i>0;i--) rep(j,5){
      if(MAP[i][j]==-1){
        MAP[i][j]=MAP[i-1][j];
        MAP[i-1][j]=-1;
      }
    }
  }
}
 
int search(int x,int y,int num,int count){
   
  if(x<0||y<0||x>=5) return count;
  if(MAP[y][x]==-1||MAP[y][x]!=num) return count;
   
 
  int ans = 0;
  count++;
  count = search(x+1,y,num,count);
 
  if(count>=3) MAP[y][x]=-1;
 
  return count;
}
 
int main(){
 
  while(1){
    cin >> h;
 
    if(h==0) break;
 
    int ans=0;
    int p_score=-1;
      memset(MAP,-1,sizeof(MAP));
      rep(i,h) rep(j,5) cin >> MAP[i][j];
 
 
      while(1){
        rep(i,h) rep(j,5){
          int point = MAP[i][j];  
          int combo = search(j,i,MAP[i][j],0);
          if(combo>=3){
            //cout << combo << " " << point << endl;
            ans+=combo*point;
          }
        }
 
        fall();
 
        if(p_score==ans) break;
        p_score=ans;
      }
    cout << ans << endl;
  }
 
}

C++: #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int H;

int board[11][6];

void solve(){
    for(int i=0;i<H;i++){
        for(int j=0;j<5;j++){
            cin>>board[i][j];
        }
    }

    int ans=0;
    while(1){
        bool change=false;
        bool dis[11][6]={};
        for(int i=0;i<H;i++){
            for(int j=0;j<5;j++){
                if(board[i][j]==0) continue;
                int x=j+1;
                int num=1;
                while(x<5){
                    if(board[i][j]==board[i][x]) num++;
                    else break;
                    x++;
                }
                if(num>=3){
                    for(int k=j;k<j+num;k++){
                        dis[i][k]=true;
                        change=true;
                    }
                }
            }
        }

        int nxboard[11][6]={};
        for(int i=0;i<H;i++){
            for(int j=0;j<5;j++){
                if(dis[i][j]) ans+=board[i][j];
            }
        }
        for(int j=0;j<5;j++){
            int high=H-1;
            for(int i=H-1;i>=0;i--){
                if(dis[i][j]) continue;
                nxboard[high][j]=board[i][j];
                high--;
            }
        }
        for(int i=0;i<H;i++) for(int j=0;j<5;j++) board[i][j]=nxboard[i][j];
        if(change==false) break;
    }
    cout<<ans<<endl;
}

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

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int H;
const int W = 5;
int fie[11][11];
int res;
bool del(){
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      int f =  fie[j][i];
      if( f && j+3<=W){
        int cnt = 0;
        for(int k=j; k < W && fie[k][i] == f; k++ )
          cnt++;
        if( cnt > 2 ){
          for(int k=j; k < W && fie[k][i] == f; k++ ){
            res += fie[k][i];
            fie[k][i] = 0;
          }
          return true;
        }
      }
    }
  }
  return false;
}

bool down(){
  bool f = false;
  for(int i=H-1;i>-1;i--){
    for(int j=0;j<W;j++){
      if( fie[j][i] == 0 ){
        fie[j][i] = fie[j][i-1];
        fie[j][i-1] = 0;
        if( fie[j][i] != 0 )
          f= true;
      }
    }
  }
  return f;
}

void view(){
  cout << "view" << endl;
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
        cout << fie[j][i] << " ";
      }     
      cout << endl;
    }
}

void sim(){

  while( del() ){
    while(del());
    while(down());
  }

}

int main(){
  while(cin >> H && H){

    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++) cin >> fie[j][i];
    }
    res = 0;
    sim();
    cout << res << endl;
  }
}