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 <algorithm>
#include <vector>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;

const int W = 5;

bool isClear ( VVI& m, int h, int l, int r )
{
	bool hit = true;
	for ( int i = l; i < r; ++i ) {
		hit &= m[h][l] == m[h][i] && m[h][i] != 0;
	}
	return hit;
}
int doClear ( VVI& m, int h, int l, int r )
{
	int sum = 0;
	for ( int i = l; i < r; ++i ) {
		sum += m[h][i];
		m[h][i] = 0;
	}
	return sum;
}

int clear ( VVI& m, int h )
{
	int sum = 0;
	for ( int y = 0; y < h; ++y ) {
		for ( int x = 0; x < W - 2; ++x ) {
			for ( int w = W; w > x + 2; --w ) {
				if ( isClear( m, y, x, w ) ) {
					sum += doClear( m, y, x, w );
				}
			}
		}
	}
	return sum;
}

bool doDrop ( VVI& m, int h )
{
	bool hit = false;
	for ( int y = h - 1; y > 0; --y ) {
		for ( int x = 0; x < W; ++x ) {
			if ( m[y][x] == 0 && m[y - 1][x] != 0 ) {
				hit = true;
				m[y][x] = m[y - 1][x];
				m[y - 1][x] = 0;
			}
		}
	}
	return hit;
}

void drop ( VVI& m, int h )
{
	while( doDrop( m, h ) );
}

int main ( void )
{
	int h;
	while ( cin >> h, h ) {
		VVI m( h, VI( W ) );
		for ( int i = 0; i < h; ++i ) {
			for ( int j = 0; j < 5; ++j ) {
				cin >> m[i][j];
			}
		}

		int ans = 0, t;
		while ( ( t = clear( m, h ) ) != 0 ) {
			ans += t;
			drop( m, h );
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265


void f(int n){
  int a[100][100];
  rep(i,n){
    rep(j,5){
      cin>>a[n-1-i][j];
    }
  }
  int ans = 0;
  bool flag = true;



  while(flag){
    
    flag = false;
    rep(i,n){
      rep(j,3){
        if(a[i][j]==0) continue;
        int b = a[i][j];
        int c = 0;
        FOR(k,j,6){
          if(b==a[i][k]) c++;
          else break;
        }
        if(c>=3){
          ans += c*b;
        
          while(b==a[i][j]){
            a[i][j]=0;
            j++;
            flag = true;
          
          }
        }
      }
    }
    rep(i,5){
      rep(j,n){
        if(a[j][i]==0){
          int k = j;
          while(a[k][i]==0&&k<n) k++;
          a[j][i] = a[k][i];
          a[k][i] = 0;
        }
      }
    }
  }

  cout<<ans<<endl;

}

int main(){
  int n;
  while(1){
    cin>>n;
    if(n==0) break;
    f(n);
  }
}

C++: #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long int ll;

int field[10][5];

int howManySameColorRight(int i, int j,int color) {
	if (j >= 5) return 0;
	if (field[i][j] == 0) return 0;
	if (color != field[i][j]) return 0;
	if (j == 4 && color == field[i][j]) return 1;
	return howManySameColorRight(i, j + 1, color) + 1;
}

void banishRightN(int i, int j, int n) {
	for (int k = 0; k < n; k++) {
		field[i][j + k] = 0;
	}
}

void moveBlocks(int h) {
	for (int i = 0; i < h - 1; i++) {
		for (int j = 0; j < 5; j++) {
			if (field[i + 1][j] == 0) {
				field[i + 1][j] = field[i][j];
				field[i][j] = 0;
			}
		}
	}
}

int main()
{
	int h;
	cin >> h;
	while (h != 0) {
		rep(i, h) {
			rep(j, 5) cin >> field[i][j];
		}
		ll ans = 0;
		rep(k, 20) {
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 5; j++) {
					int blocks = howManySameColorRight(i, j, field[i][j]);
					if (blocks >= 3) {
						ans += blocks * field[i][j];
						banishRightN(i, j, blocks);
					}
				}
			}
			rep(l,100)moveBlocks(h);
			/*cout << "------------" << endl;
			rep(i, h) {
				rep(j, 5) cout << field[i][j] << " ";
				cout << endl;
			}*/
		}
		cout << ans << endl;
		cin >> h;
	}
	


	return 0;
}