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

int fie[10][10];
int cnt_h[10][10];
int bomb[10][10];
int next[10];
int h;

void fall(int x){
	memset(next,0,sizeof(next));
	int cnt=h-1;
	for(int i=h-1;i>=0;i--){
		if(fie[x][i]!=0)next[i]=cnt,cnt--;
	}
	for(int i=h-1;i>=0;i--){
		if(fie[x][i]!=0)fie[x][next[i]]=fie[x][i];
	}
	for(int i=0;i<=cnt;i++)fie[x][i]=0;
}

void bomber(){
	for(int i=0;i<h;i++){
		for(int j=0;j<5;j++){
			if(bomb[j][i]==1)fie[j][i]=0;
		}
	}
	for(int i=0;i<5;i++)fall(i);
}

int main(void){
	while(1){
		scanf("%d",&h);
		if(h==0)break;
		memset(fie,0,sizeof(fie));
		int all=0;
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				scanf("%d",&fie[j][i]);
				all+=fie[j][i];
			}
		}
		int flag=1,cnt=1;
		while(flag){
			flag=0;
			memset(cnt_h,0,sizeof(cnt_h));
			memset(bomb,0,sizeof(bomb));
			for(int i=0;i<h;i++){
				cnt=1;
				for(int j=1;j<5;j++){
					if(fie[j][i]==fie[j-1][i] && fie[j][i]!=0)cnt++;
					else cnt=1;
					cnt_h[j][i]=cnt;
				}
			}
			for(int i=0;i<h;i++){
				for(int j=2;j<5;j++){
					if(cnt_h[j][i]==3){
						bomb[j-2][i]=bomb[j-1][i]=bomb[j][i]=1;
						flag=1;
					}
					if(cnt_h[j][i]>3)bomb[j][i]=1;
				}
			}
			if(flag)bomber();
		}
		int rest=0;
		for(int i=0;i<5;i++){
			for(int j=0;j<h;j++)rest+=fie[i][j];
		}
		printf("%d\n",all-rest);
	}
	return 0;
}

C++: #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int h,w,dp[50][5],ans,cnt,rans;
vector<int> v;
void re(void){
    for(int i=0;i<5;i++){
        v={};
        cnt=0;
        for(int j=h-1;j>=0;j--){
            if(dp[j][i]!=0)v.push_back(dp[j][i]);
            else cnt++;
        }
        while(cnt--)v.push_back(0);
        for(int j=h-1;j>=0;j--){
            dp[j][i]=v[h-j-1];
        }
    }
    return ;
}
int ch(void){
    ans=0;
    for(int i=0;i<h;i++){
        if(dp[i][0]==dp[i][1]&&dp[i][0]==dp[i][2]&&dp[i][0]==dp[i][3]&&dp[i][0]==dp[i][4]){
            ans+=dp[i][0]*5;
            dp[i][0]=dp[i][1]=dp[i][2]=dp[i][3]=dp[i][4]=0;
        }
        else if(dp[i][0]==dp[i][1]&&dp[i][0]==dp[i][2]&&dp[i][0]==dp[i][3]){
            ans+=dp[i][0]*4;
            dp[i][0]=dp[i][1]=dp[i][2]=dp[i][3]=0;
        }
        else if(dp[i][1]==dp[i][2]&&dp[i][1]==dp[i][3]&&dp[i][1]==dp[i][4]){
            ans+=dp[i][1]*4;
            dp[i][4]=dp[i][1]=dp[i][2]=dp[i][3]=0;
        }
        else if(dp[i][0]==dp[i][1]&&dp[i][0]==dp[i][2]){
            ans+=dp[i][0]*3;
            dp[i][0]=dp[i][1]=dp[i][2]=0;
        }
        else if(dp[i][1]==dp[i][2]&&dp[i][1]==dp[i][3]){
            ans+=dp[i][1]*3;
            dp[i][1]=dp[i][2]=dp[i][3]=0;
        }
        else if(dp[i][2]==dp[i][3]&&dp[i][2]==dp[i][4]){
            ans+=dp[i][2]*3;
            dp[i][2]=dp[i][3]=dp[i][4]=0;
        }
    }
    if(ans==0)return 0;
    rans+=ans;
    return 1;
}
int main(void){
    while(1){
    cin>>h;
    if(h==0)return 0;
    rans=0;
    for(int i=0;i<h;i++){
        for(int j=0;j<5;j++)cin>>dp[i][j];
    }
    while(1){
        if(ch()==0)break;
        re();
        for(int i=0;i<h;i++){
            for(int j=0;j<5;j++){
                //cout<<dp[i][j];
            }
            //cout<<endl;
        }
    }
    cout<<rans<<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;
    cout<<endl;
    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++,p=j;
	  else if(c<3)c=1,p=j;
	if(c>=3){
	  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]),f=1;
    }
    cout<<ans<<endl;
  }
  return 0;
}

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

using ll = long long;

#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define FORR(i,a,b) for(int i=b-1;i>=a;i--)

#define DEBUG(x) cerr<<#x<<": "<<(x)<<endl

int h;
int w = 5;
int mp[12][5];

int main(){
    while(true){
        cin>>h;
        if(h==0)break;
        REP(i,h)REP(j,w)cin>>mp[i][j];
        int ans = 0;
        while(true){
            bool flag = false;
            REP(i,h){
                REP(j,3){
                    int v = mp[i][j];
                    if(v==0)continue;
                    int k = j+1;
                    while(k<w && mp[i][k]==v)k++;
                    if(k-j<3)continue;
                    ans += v * (k-j);
                    FOR(x,j,k)mp[i][x] = 0;
                    flag = true;
                    break;
                }
            }
            if(!flag)break;
            FORR(i,1,h)REP(j,w)if(mp[i][j]==0){
                int y = -1;
                FORR(k,0,i)if(mp[k][j]!=0){
                    y = k; break;
                }
                if(y==-1)continue;
                swap(mp[i][j], mp[y][j]);
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}