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 <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
using namespace std;

int main() {
	
	while(true){
		int H;
		cin >> H;
		
		if(H == 0){
			break;
		}
		
		int ss = 0;
		int a[20][20] = {};
		
		for(int i = H - 1; i >= 0; i--){
			for(int j = 1; j <= 5; j++){
				cin >> a[i][j];
				ss += a[i][j];
			}
		}
		
		while(true){
			
			bool is_ext = false;
			bool ext[20][20] = {};
			
			for(int i = 0; i < H; i++){
				for(int j = 1; j <= 5; j++){
					if(a[i][j - 1] == a[i][j] && a[i][j] == a[i][j + 1] && a[i][j] > 0){
						ext[i][j - 1] = true;
						ext[i][j] = true;
						ext[i][j + 1] = true;
						is_ext = true;
						//cout << i << " " << j << endl;
					}
				}
			}
			if(!is_ext){
				break;
			}
			
			for(int i = 0; i < H; i++){
				for(int j = 1; j <= 5; j++){
					if(ext[i][j]){
						a[i][j] = -1;
					}
				}
			}
			
			/*
			for(int i = H - 1; i >= 0; i--){
				for(int j = 1; j <= 5; j++){
					cout << a[i][j] << " ";
				}
				cout << endl;
			}
			cout << endl;
			*/
			
			for(int loop = 0; loop <= H; loop++){
				for(int i = 0; i < H; i++){
					for(int j = 1; j <= 5; j++){
						if(a[i][j] == -1){
							a[i][j] = a[i + 1][j];
							a[i + 1][j] = -1;
						}
					}
				}
			}
			
			/*
			for(int i = H - 1; i >= 0; i--){
				for(int j = 1; j <= 5; j++){
					cout << a[i][j] << " ";
				}
				cout << endl;
			}
			cout << endl;
			*/
		}
		
		int rem = 0;
		
		for(int i = H - 1; i >= 0; i--){
			for(int j = 1; j <= 5; j++){
				//cout << a[i][j] << " ";
				if(a[i][j] > 0){
					rem += a[i][j];
				}
			}
			//cout << endl;
		}
		
		cout << ss - rem << endl;
		
	}
	return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a)      memset((a),0,sizeof(a))
#define MCLR(a)     memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int main(){
	int h,w;
	int cnt=0;

	int box[10][5];

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

		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				cin >> box[i][j];
			}
		}

		for(int g=0;g<h;g++){
			
			for(int i=0;i<h;i++){
				for(int j=0;j<3;j++){
					cnt=0;
					for(int k=j+1;k<5;k++){
						if(box[i][j]!=box[i][k]){
							break;
						}
						cnt++;
					}
					if(cnt>=2){
						for(int k=j;k<=j+cnt;k++){
							pt+=box[i][k];
							box[i][k]=0;
						}
						break;
					}
				}
			}

			for(int i=0;i<5;i++){
				int cnt=0;
				VI v;
				for(int j=h-1;j>=0;j--){
					if(box[j][i]!=0){
						v.PB(box[j][i]);
						box[j][i]=0;
						cnt++;
					}
				}
				for(int j=1;j<=cnt;j++){
					box[h-j][i]=v[j-1];
				}
				v.clear();
			}
		}
/*
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				cout << box[i][j];
			}
			cout << endl;
		}
*/
		cout << pt << endl;					
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>

#define MAX_H 10

using namespace std;

int s[5][MAX_H+1];
int H;

void solve() {
	int point = 0, pre = 0;
	while(1){
		pre = point;
		for (int i = 0; i < H; i++)
		{
			for (int j = 0; j < 3; j++)
			{
				if(s[j][i] == s[j+1][i] && s[j+1][i] == s[j+2][i]){
					int p = s[j][i];
					for (int k = j; k < 5; k++)
					{
						if(s[k][i] != p) break;
						s[k][i] = 0;
						point += p;
					}
				}
			}
		}
		if(point == pre) break;
		for (int i = 0; i < 5; i++)
		{
			for (int j = H-1; j >= 0 ; j--)
			{
				if(s[i][j] == 0){
					for (int k = j-1; k >= 0; k--)
					{
						if(s[i][k] != 0){
							s[i][j] = s[i][k];
							s[i][k] = 0;
							break;
						}
					}
				}
			}
		}
	}
	cout << point << endl;
	return;
}

int main(){
	while(1){
		cin >> H;
		if(H == 0) break;
		for (int i = 0; i < H; i++)
		{
			for (int j = 0; j < 5; j++)
			{
				cin >> s[j][i];
			}
		}
		solve();
	}
	return 0;
}