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 <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    int h;
    while(cin>>h,h){
        vvi v(h,vi(5));
        rep(i,h)rep(j,5)cin>>v[i][j];
        vector<pair<pii,int>>del;
        ll ans=0;
        bool flag=true;
         vector<vector<bool>>used(h,vb(5,true));
        while(flag){
            del.clear();
            for(int i=0; i<h;i++){
                for(int j=0; j<4;j++){
                    if(!used[i][j])continue;
                    bool foo=true;
                    int cnt=1;
                    int k=j+1;
                    while (foo&&k<5) {
                        if(!used[i][k])break;
                        if(v[i][j]==v[i][k]){cnt++;k++;}
                        else foo=false;
                    }
                    if(cnt<3)continue;
                    del.push_back(make_pair(pii(i,j),cnt));
                    rep(_,cnt-1)used[i][j+_]=false;
                   // cout<<v[i][j]<<" "<<cnt<<endl;
                    ans+=cnt*v[i][j];
                }
            }
            if(del.empty())break;
            vector<vector<int>>temp(h,vi(5));
            rep(i,h){
                rep(j,5){
                    rep(k,del.size()){
                        if(del[k].first==pii(i,j)){
                            rep(_,del[k].second)
                            used[del[k].first.first][del[k].first.second+_]=false;
                        }
                    }
                }
            }
            int last[10000]={0};
            for(int i=h-1; i>=0;i--){
                rep(j,5){
                    if(!used[i][j])continue;
                    {temp[(h-1-last[j])][j]=v[i][j];used[h-1-last[j]][j]=true;last[j]++;}
                }
            }
            v=temp;
            //rep(i,h){rep(j,5)cout<<v[i][j];cout<<endl;}
            //cout<<endl;
        }
        cout<<ans<<endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
 
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back 
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}


//????????????

int s[20][5];
int h;
int hoge;
int score = 0;

//?????????????????£?????????
int right(int a){
  int r=0;
  if(s[a][2] == -1) return r;
  if(s[a][2] == s[a][3]){
	r++;
	if(s[a][3] == s[a][4]){
	  r++;
	}
  }
  return r;
}

//?????????????????????
int left(int a){
  int l = 0;
  if(s[a][2] == -1) return l;
  if(s[a][2]==s[a][1]){
	l++;
	if(s[a][1]==s[a][0]){
	  l++;
	}
  }
  return l;
}

//0????????¨???????????§?????????????¶?????????????????????????
bool kesu(){
  bool result = false;
  REP(i,h){
	REP(j,5){
	  if(s[i][j] == 0){
		for(hoge = i;hoge > 0;hoge--){
		  s[hoge][j] = s[hoge - 1][j];
		  result = true;
		}
		s[0][j] = -1;
	  }
	}
  }
  return result;
}

/*
1 0 0 0 0
1 2 3 0 0
1 2 3 4 5
??????????????¨????????????????????????????????¨??????????????????????????????

?????£??????????¶?????????¨??????0??????????¶????????????¨??????-1??¨???????????¨??§???????????????
 */

//?¶????????????°?¢????????????????????????¨??????0?????\??????????????¢?????????????????????
int piyo(int a){

  int sum = 0;
  int res = 0;

  sum = left(a)+right(a)+1;

  if(sum >= 3){

	res = sum * s[a][2];
	int now = s[a][2];
	REP(i,5) if(s[a][i]==now) {
	  //	 cout << i << endl;
	  s[a][i] = 0;
	}
	return res;
  }else{
	return 0;
  }
}


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

	REP(i,20) REP(j,5) s[i][j] = 0;
	score = 0;
	bool fin = true;

	REP(i,h) cin >> s[i][0] >> s[i][1] >> s[i][2] >> s[i][3] >> s[i][4];

	while(fin){

	  REP(i,h){
		score += piyo(i);
	  }
	  //	  cout <<score << endl;
	  fin = kesu();
	  //	REP(i,h) cout << s[i][0] << " " << s[i][1] << " " << s[i][2] << " " << s[i][3] << " "<< s[i][4] << endl;//
	}

	cout << score << endl;
  }
}