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>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;

int H, A[10][5];
bool v[10][5];

int main(void) {
  while(cin >> H, H) {
    REP(i, 0, H) REP(j, 0, 5) cin >> A[H - i - 1][j];
    int ans = 0;
    bool cont = true;
    while(cont) {
      cont = false;
      REP(i, 0, H) REP(j, 0, 5) v[i][j] = false;
      REP(i, 0, H) REP(j, 0, 3) {
        if(A[i][j] != 0 && A[i][j] == A[i][j + 1] && A[i][j] == A[i][j + 2]) {
          v[i][j] = v[i][j + 1] = v[i][j + 2] = true;
          cont = true;
        }
      }
      REP(i, 0, H) REP(j, 0, 5) if(v[i][j]) ans += A[i][j];
      REP(j, 0, 5) REP(i, 0, H) {
        if(v[i][j]) {
          REP(k, i + 1, H) {
            A[k - 1][j] = A[k][j];
            v[k - 1][j] = v[k][j];
          }
          A[H - 1][j] = 0;
          v[H - 1][j] = false;
          i--;
        }
      }
    }
    cout << ans << endl;
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, s, n) for(int i = s; i < n; i++)
#define repr(i, n) for(int i = n-1; i >= 0; i--)
#define repr2(i, s, n) for(int i = n-1; i >= s; i--)
using namespace std;

int main(){
  while(1){
    int h;
    cin >> h;
    if(h == 0) break;
    vector<vector<int>> board(h, vector<int>(5));
    rep(i, h)rep(j, 5) cin >> board[i][j];
    int score = 0;
    bool flag;
    while(1){
      flag = true;
      // 消滅させる
      rep(i, h){
        int count;
        int prev = -1;
        int now;
        rep(j, 5){
          now = board[i][j];
          if (now == 0) count = 0;
          else if (now != prev) count = 1;
          else count++;
          if (count == 3){
            flag = false; // 一回でも消滅したらもう一度判定する
            score += now * 3;
            board[i][j] = board[i][j-1] = board[i][j-2] = 0;
          }
          else if (count > 3){
            score += now;
            board[i][j] = 0;
          }
          prev = now;
        }
      }
      // 消滅しなかったら終わり
      if (flag) break;
      
      // 消滅した分、下に下げる
      rep(k, h-1)repr2(i, k+1, h)rep(j, 5){
        if (board[i][j] == 0){
          board[i][j] = board[i-1][j];
          board[i-1][j] = 0;
        }
      }
    }
    cout << score << endl;
  }
  
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int main(){
	while(1){
		int h;
		cin >> h; if(h == 0) return 0;
		vector<int>x[5];
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				int a; cin >> a; x[j].pb(a);
			}
		}
		rep(i,5) reverse(x[i].begin(),x[i].end());
		int ret = 0;
		while(1){
			bool upd = 0;
			for(int i=0;i<h;i++){
				for(int j=0;j<3;j++){
					if(x[j].size() <= i || x[j+1].size() <= i || x[j+2].size() <= i) continue;
					if(x[j][i] == x[j+1][i] && x[j+1][i] == x[j+2][i]){
					    bool ok = 0;
						if(j+3<5 && x[j+3].size() > i && x[j+3][i] == x[j][i]){
							ret += x[j][i];
							x[j+3][i] = -1;
							ok = 1;
						}
						if(ok && j+4<5 && x[j+4].size() > i && x[j+4][i] == x[j][i]){
							ret += x[j][i];
							x[j+4][i] = -1;
						}
						ret += 3*x[j][i];
						x[j][i] = -1;
						x[j+1][i] = -1;
						x[j+2][i] = -1;
						//ret += 3*x[j][i];
						upd = 1;
						break;
					}
				}
			}
			vector<int>y[5];
			for(int i=0;i<5;i++){
				for(int j=0;j<x[i].size();j++){
					if(x[i][j] != -1) y[i].pb(x[i][j]);
				}
				x[i] = y[i];
			}
			//if(h==5)for(int i=0;i<5;i++) cout << x[i][0] << endl;
			if(!upd) break;
		}
		cout << ret << endl;
	}
}

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

using ll=long long;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)

int read(){
	int i;
	scanf("%lld",&i);
	return i;
}

signed main(){
	while(true){
		int H=read();
		if(H==0) break;
		
		int table[H][5]={0};
		REP(i,H){
			REP(j,5){
				table[i][j]=read();
			}
		}
		
		int point=0;
		while(true){
			REP(i,H){
				int count=1;
				int tmpvalue=0;
				FOR(j,1,5){
					if(table[i][j]==table[i][j-1]){
						count++;
						tmpvalue=table[i][j];
					}
					else if(count>=3){
						REP(k,count){
							table[i][j-1-k]=0;
						}
						point+=count*tmpvalue;
						count=1;
					}
					else count=1;
					
					if(j==4&&count>=3){
						REP(k,count){
							table[i][j-k]=0;
						}
						point+=count*tmpvalue;
						count=0;
					}
				}
			}
			bool flag=true;
			REP(j,5){
				for(int i=H-2;i>=0;i--){
					for(int k=0;k+i<4;k++){
						if(table[i+k][j]!=0&&table[i+1+k][j]==0){
							flag=false;
							table[i+1+k][j]=table[i+k][j];
							table[i+k][j]=0;
						}
					}
				}
			}
			
			/*REP(i,H){
				REP(j,5){
					cout << table[i][j];
				}
				cout << endl;
			}
			cout << endl;*/
			if(flag) break;
		}
		cout << point << endl;
	}
}