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

int x[2000][5], H;

int solve() {
	int score = 0;
	for (int i = 0; i < 500; i++)
	{
		for (int j = 0; j < H; j++)
		{
			if (x[j][0] == x[j][1] && x[j][1] == x[j][2] && x[j][2] == x[j][3] && x[j][3] == x[j][4] && x[j][0] >= 1) {
				score += x[j][0] * 5;
				x[j][0] = 0;
				x[j][1] = 0;
				x[j][2] = 0;
				x[j][3] = 0;
				x[j][4] = 0;
			}
		}
		for (int j = 0; j < H; j++)
		{
			for (int k = 0; k < 2; k++)
			{
				if (x[j][k + 0] == x[j][k + 1] && x[j][k + 1] == x[j][k + 2] && x[j][k + 2] == x[j][k + 3] && x[j][k + 0] >= 1) {
					score += x[j][k + 0] * 4;
					x[j][k + 0] = 0;
					x[j][k + 1] = 0;
					x[j][k + 2] = 0;
					x[j][k + 3] = 0;
				}
			}
		}
		for (int j = 0; j < H; j++)
		{
			for (int k = 0; k < 3; k++)
			{
				if (x[j][k + 0] == x[j][k + 1] && x[j][k + 1] == x[j][k + 2] && x[j][k + 0] >= 1) {
					score += x[j][k + 0] * 3;
					x[j][k + 0] = 0;
					x[j][k + 1] = 0;
					x[j][k + 2] = 0;
				}
			}
		}
		for (int j = 0; j < 500; j++) {
			for (int j = 1; j < H; j++) {
				for (int k = 0; k < 5; k++) {
					if (x[j][k] == 0) {
						x[j][k] = x[j - 1][k];
						x[j - 1][k] = 0;
					}
				}
			}
		}
	}
	return score;
}

int main() {
	while (true) {
		cin >> H;
		if (H == 0) { break; }
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> x[i][j];
			}
		}
		cout << solve() << endl;
	}
	return 0;
}

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

int main(){
	  while(1){
			int H; cin >> H;
			if(!H) break;
			int b[H][6]={};

			for(int i=0; i<H; i++)
				  for(int j=0; j<5; j++)
						cin >> b[i][j];

			bool f=true;
			int ans = 0;
			while(f){
				  f=false;
				  // ?°´??? 
				  for(int i=0; i<H; i++){
						int pre = 0;
						int len = 1;
						for(int j=1; j<6; j++){
							  if(b[i][pre] == b[i][j]){
									len++;
							  }
							  else{
									if(len >= 3 and b[i][pre] != -1){
										  ans += b[i][pre]*len;
										  //cout << b[i][pre] << "*" << len << endl;
										  int tmp = b[i][pre];
										  for(int k=j-1; b[i][k] == tmp; k--)
												b[i][k] = -1;
										  f = true;
									}
									pre = j;
									len = 1;
							  }
						}
				  }

				  // ??????
				  for(int i=H-1; i>=0; i--){
						for(int j=0; j<5; j++){
							  if(b[i][j] == -1)
									for(int k=i-1; k>=0; k--)
										  if(b[k][j] != -1){
												swap(b[k][j],b[i][j]);
												break;
										  }
							  
						}
				  }


			}
			cout << ans << endl;
	

	  }
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define pri(a) cout << (a) << endl
vector< vector<ll> > paz;
vector< vector<ll> > pazp;
ll score,N;
void pazdrop(){
	pazp = paz;
	paz = vector<vector<ll>>(N,vector<ll>(5, 0));
	FOR(i,0,5){
		ll k = N-1;
		FORR(j,0,N){
			if(pazp[j][i]!=0){
				paz[k][i] = pazp[j][i];
				k--;
			}
		}
	}
}
bool pazclear(){
	bool c = false;
	FOR(i,0,N){
		ll n = paz[i][0];
		ll k = 0;
		FOR(j,0,5){
			if(paz[i][j]==n){
				k++;
			}else{
				if(k>2&&n!=0){
					c = true;
					FOR(l,1,k+1){
						score+=paz[i][j-l];
						paz[i][j-l]=0;
					}	
				}
				k = 1;
				n = paz[i][j];
			}
		}
		if(k>2&&n!=0){
			c = true;
			FOR(l,1,k+1){
				score+=paz[i][5-l];
				paz[i][5-l]=0;
			}
		}
	}
	if(c)pazdrop();
	return c;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin>>N){
		if(N==0)break;
		score = 0;
		paz =  vector< vector<ll> >(N,vector<ll>(5, 0));
		FOR(i,0,N){
			FOR(j,0,5){
				cin >> paz[i][j];
			}
		}
		while(pazclear());
		cout << score << endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(){
	int h;
	while(cin>>h){
		if(h==0) break;
		int a[h][5];
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				cin>>a[i][j];
			}
		}
		int now,ct=0,tp=0,p=1;
		while(p>0){
			p=0;
			for(int i=0;i<h;i++){
				ct=0;
				now=0;
				for(int j=0;j<5;j++){
					if(a[i][j]==now){
						ct++;
					}
					else if(a[i][j]!=now&&ct>=2){
						for(int k=0;k<j;k++){
							if(a[i][k]==now){
								a[i][k]=0;
								p=p+now;
							}
						}
						now=a[i][j];
						ct=0;
					}
					else{
						ct=0;
						now=a[i][j];
					}
				}
				if(ct>=2){
					for(int j=4-ct;j<=4;j++){
						a[i][j]=0;
						p=p+now;
					}
				}
			}
			tp=tp+p;
			for(int i=0;i<=h-1;i++){
				for(int j=0;j<5;j++){
					if(a[i][j]==0){
						for(int k=i-1;k>=0;k--){
							a[k+1][j]=a[k][j];
						}
						a[0][j]=0;
					}
				}
			}
		}
		cout<<tp<<endl;
	}
    return 0;
}