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<bits/stdc++.h>

#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)

#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>

#define MOD 1000000007
#define INF 1000000000000000LL

using namespace std;
#define MAXH 10
int h;
int result=0;
vector<vector<int>>b(MAXH, vector<int>(5));

void initb(){
  rep(i, MAXH)rep(j, 5)b[i][j]=0;
  result=0;
}

void banish(int h){
  if(b[h][0]==b[h][1] && b[h][0]==b[h][2] && b[h][0]==b[h][3] && b[h][0]==b[h][4]){
    result+=5*b[h][0];
    rep(i, 5)b[h][i]=0;
    return;
  }

  rep(i, 2){
    if(b[h][i]==b[h][i+1] && b[h][i]==b[h][i+2] && b[h][i]==b[h][i+3]){
      result+=4*b[h][i];
      rep(j, 4)b[h][j+i]=0;
      return;
    }
  }

  rep(i, 3){
    if(b[h][i]==b[h][i+1] && b[h][i]==b[h][i+2]){
      result+=3*b[h][i];
      rep(j, 3)b[h][j+i]=0;
      return;
    }
  }
}

void fall(){
  rep(i, 5)rep(j, h){
    if(b[j][i]>0)continue;

    rep(k, h)for(int k=j; k<h-1; k++)if(b[k][i]==0)swap(b[k][i], b[k+1][i]);
  }
}

int solve(){
  initb();

  rrep(i, h)rep(j, 5)cin>>b[i][j];

  rep(j, h){
    rep(i, h)banish(i);
    fall();
  }

  return result;
}

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

    cout<<solve()<<endl;
  }

  return 0;
}

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;
  }
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
  int h;
  cin >> h;
  while(h!=0){
    vector <int> lines[5];
    int b[10][5];
    int i,j,k;
    for(i=0;i<h;i++){
      for(j=0;j<5;j++){
        cin >> b[i][j];
      }
    }
    for(i=h-1;i>=0;i--){
      for(j=0;j<5;j++){
        lines[j].push_back(b[i][j]);
      }
    }
     
    int o=0;
    int f=0,ba,l;
    while(f==0){
       
      k=0;
       
      for(i=0;i<5;i++) k+=lines[i].size();
       
      for(i=h-1;i>=0;i--){
        l=0;
        ba=0;
        for(j=0;j<5;j++){
                if(lines[j].size()>i){
                    if(ba==0){
                        ba=lines[j][i];
                        l=1;
                    }else if(ba==lines[j][i]){
                        l++;
                    }else{
                        if(l>=3){
                            o+=ba*l;
                            for(int a=1;a<=l;a++) lines[j-a].erase(lines[j-a].begin()+i);
                        }
                    ba=lines[j][i];
                    l=1;
                    }
                }else{
            ba=0;
            l=0;
            }
        }
     
        if(l>=3){
            o+=ba*l;
            for(int a=0;a<l;a++) lines[4-a].erase(lines[4-a].begin()+i);
        }   
     
    }
    for(i=0;i<5;i++) k-=lines[i].size();
    if(k==0) f=1;
    }
     
    cout << o << endl;
    cin >> h;
  }
  return 0;
}