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++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;
#define debug2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define debugg(g,h,w) rep(i,0,h) { rep(j,0,w) cout << g[i][j] << " "; cout << endl;}
#define debugv(v) for(auto&& x : v){cout << x << " ";} cout << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef vector<vector<int> > VVi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
typedef pair<ll, ll> Pll;

int g[10][5];
int n;
int score;

int check()
{
	int ret = 0;

	rep(i,0,n) rep(j,0,3) {
		if (g[i][j] > 0 && g[i][j] == g[i][j+1] && g[i][j] == g[i][j+2]) {
			int num = g[i][j];
			int same = 0;
			int jj = j;
			while (jj < 5) {
				if (g[i][jj] == num) {
					same++;
					g[i][jj] = -1;
					jj++;
				}
				else break;
			}
			score += num * same;
			ret++;
			continue;
		}
	}
	return ret;
}

void down()
{
	bool update = true;
	while (update) {
		update = false;
		rep(i,0,n-1) rep(j,0,5) {
			if (g[i][j] > 0 && g[i+1][j] == -1) {
				swap(g[i][j], g[i+1][j]);
				update = true;
			}
		}
	}
}

int main()
{
	Vi vans;
	while (1) {
		cin >> n;
		if (!n) break;
		rep(i,0,n) rep(j,0,5) cin >> g[i][j];
		score = 0;
		
		while (1) {
			int a = check();
			if (!a) break;
			down();
			//debugg(g,n,5);
			//debug(score);
		}
		//cout << score << endl;
		vans.pb(score);
	}
	for (auto a:vans) cout << a << endl;
	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-1;y2>=0;y2--){
				if(S[y2][x]!=0){
					S[y][x]=S[y2][x]=0;
					S[y2][x]=0;
					break;
				}
			}
		}
	}
 }
 cout<<sco<<endl;
}
return 0;
}

C++: #include<bits/stdc++.h>

#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
using namespace std;
int a[10][5],check[10][5];
int main(){
  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    lp(i,10){
      lp(j,5){
	a[i][j]=-1;
	check[i][j]=0;
      }
    }
    
    for(int i=n-1;i>=0;i--){
      lp(j,5){
	cin>>a[i][j];
      }
    }
    int ans=0;
    while(1){
      int r=0;
      lp(i,n){
	lp(j,3){
	  if(a[i][j]!=-1&&a[i][j]==a[i][j+1]&&a[i][j+2]==a[i][j+1]){
	    check[i][j]=1;
	    check[i][j+1]=1;
	    check[i][j+2]=1;
	    r=1;
	  }
	}
      }
      if(r==0) break;
      
      lp(i,n){
	while(1){
	  int x=0;
	  lp(j,5){
	    if(check[i][j]==1){
	      ans+=a[i][j];
	      for(int k=i;k<n;k++){
		a[k][j]=a[k+1][j];
		a[k+1][j]=-1;
		check[k][j]=check[k+1][j];
		check[k+1][j]=0;
		x=1;
	      }
	    }
	  }
	  if(x==0) break;
	}
      }
    }
    cout<<ans<<endl;
  }
  return 0;
}