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>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef pair<int, int> P;
typedef pair<int, P> PP;

int H, W = 5;

vector<PP> check(vector< vector<int> > &v){
  vector<PP> res;
  REP(i, H){
    int j = 0;
    while(j < W){
      int cnt = 0, tar = v[i][j];
      while(j < W && v[i][j] == tar) { ++cnt; ++j; }
      if(tar != -1 && cnt >= 3) res.push_back(PP(cnt, P(i, j)));
    }
  }
  return res;
}

int remove(vector< vector<int> > &v, vector<PP> &ps){
  int res = 0;
  REP(i, ps.size()){
    int cnt = ps[i].first, y = ps[i].second.first, x = ps[i].second.second;
    REP(j, cnt){
      res += v[y][x - j - 1];
      v[y][x - j - 1] = -1;
    }
  }
  return res;
}

void drop(vector< vector<int> > &v){
  for(int i = H - 1; i >= 0; --i){
    REP(j, W){
      if(v[i][j] != -1) continue;
      for(int y = i - 1; y >= 0; --y){
        if(v[y][j] != -1){
          swap(v[y][j], v[i][j]);
          break;
        }
      }
    }
  }
}

int main() {
  while(cin >>H && H){
    vector< vector<int> > v(H, vector<int>(W));
    REP(i, H) REP(j, W) cin >>v[i][j];
    vector<PP> ps = check(v);
    int res = 0;
    while(ps.size()){
      res += remove(v, ps);
      drop(v);
      ps = check(v);
    }
    cout <<res <<endl;
  }
  return 0;
}

C++: import java.util.Scanner;

public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        while(true){
            int h = sc.nextInt();
            if(h==0)break;
            int[][] f = new int[h][5];
            for (int i = 0; i < f.length; i++) {
                for (int j = 0; j < 5; j++) {
                    f[f.length-1-i][j]=sc.nextInt();   
                      
                }
            }
            System.out.println(calc(f));
        }
    }
    static int calc(int[][] f){
        int res = 0;
        while(true){
            boolean[][] checked = new boolean[f.length][5];
            int point = 0;
            for (int i = 0; i < f.length; i++) {
                for (int j = 0; j < 3; j++) {
                    for (int j2 = 1; j2 <= 9; j2++) {
                        boolean flg =true;
                        for (int k = 0; k < 3; k++) {
                            if(f[i][j+k]!=j2){
                                flg=false;
                            }
                        }
                        if(flg){
                            for (int k = 0; k < 3; k++) {
                                checked[i][j+k]=true;
                            }
                        }
                    }
                }
            }
            for (int i = 0; i < checked.length; i++) {
                for (int j = 0; j < 5; j++) {
                    if(checked[i][j]){
                        point+=f[i][j];
                        f[i][j]=0;
                    }
                }
            }
            
            if(point==0)break;
            res+=point;
            fall(f);
        }
        return res;
    }
    static void fall(int[][] f){
        for (int i = 0; i < f.length; i++) {
            for (int j = 0; j < 5; j++) {
                while(f[i][j]==0 && above(f,i,j)){
                    for (int j2 = i; j2 < f.length-1; j2++) {
                        f[j2][j] = f[j2+1][j];
                    }
                }
            }
        }
    }
    static boolean above(int[][]f,int y,int x){
        for (int i = y+1; i < f.length; i++) {
            if(f[i][x]>0)return true;
        }
        return false;
    }
   
}