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>
using namespace std;

int main(){
    int h;
    while(cin >> h, h){
        int mat[h][5];
        for(int i = 0; i < h; i++){
            for(int j = 0; j < 5; j++){
                cin >> mat[i][j];
            }
        }

        int score = 0;
        bool update = true;

        while(update){
            update = false;

            // vanish
            for(int i = h; i >= 0; i--){
                for(int j = 0; j < 3; j++){
                    if(mat[i][j] == 0)  continue;
                    int pos = j;
                    while(pos+1 < 5 && mat[i][j] == mat[i][pos+1])  pos++;

                    // vanish!
                    if(pos-j+1 >= 3){
                        update = true;
                        for(int d = j; d <= pos; d++){
                            score += mat[i][d];
                            mat[i][d] = 0;
                        }
                        j = pos;
                    }
                }
            }

            // fall
            for(int i = h-2; i >= 0; i--){
                for(int j = 0; j < 5; j++){
                    if(mat[i][j]){
                        int cpi = i;
                        while(cpi+1 < h && mat[cpi+1][j] == 0){
                            swap(mat[cpi+1][j], mat[cpi][j]);
                            cpi++;
                        }
                    }
                }
            }
        }

        cout << score << endl;
    }

    return 0;
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

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

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
  int H, W = 5;
  while(cin >> H, H){
	int bl[12][5];
	fill((int*)bl, (int*)bl+12*5, -1);
	REP(i,H) REP(j,W) cin >> bl[i][j];
	bool updated = true;
	int ans = 0;
	while(updated){
	  updated = false;
	  REP(y,H){
		int prv = -1, cnt = 0;
		REP(x,W){
		  if(bl[y][x] != prv){
			if(cnt >= 3){
			  FOR(dx,1,cnt+1)
				bl[y][x-dx] = 0;
			  ans += prv * cnt;
			}
			prv = bl[y][x];
			cnt = 1;
		  }
		  else ++cnt;
		}

		if(cnt >= 3){
		  FOR(dx,1,cnt+1)
			bl[y][W-dx] = 0;
		  ans += prv * cnt;
		}
	  }

	  for(int y=H-1;y>=0;--y){
		REP(x,W){
		  if(bl[y][x] == 0) continue;
		  int ty = y+1;
		  while(bl[ty][x] == 0) ++ty;
		  --ty;
		  if(y != ty){
			bl[ty][x] = bl[y][x];
			bl[y][x] = 0;
			updated = true;
		  }
		}
	  }
	}
	cout << ans << endl;
  }
  
  return 0;
}