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<algorithm>
#include<iostream>
#include<cmath>
#include<climits>
#include<vector>
using namespace std;

int main(){
    int H;
    while(cin >> H, H!=0){
        int point = 0;
        //??\???
        vector< vector<int> > board(5, vector<int>(H, 0));
        for(int i=H-1; i>=0; i--){
            for(int j=0; j<5; j++){
                cin >> board[j][i];
            }
        }
        //?¶????
        for(;;){
            bool isEnd = true;
            for(int i=0; i<H; i++){
                for(int j=0; j<3; j++){
                    if(board[j][i]==board[j+1][i] && board[j+1][i]==board[j+2][i]){

                        int tmp = board[j][i];
                        if(tmp==0) break;
                        isEnd = false;
                        for(int k=0; j+k<5; k++){
                            if(board[j+k][i]==tmp){
                                point+=tmp;
                                board[j+k][i]=0;
                            }
                        }
                    }
                }
            }
            for(int i=0; i<5; i++){
                vector<int>::iterator end = remove(board[i].begin(), board[i].end(), 0);
                for (vector<int>::iterator p=end; p!=board[i].end(); ++p) *p = 0;
            }
            if(isEnd) break;
        }
    cout << point << endl;
    }
    return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#ifdef Debug
#define dump(x)  cerr << #x << " = " << (x) << endl
#else
#define dump(x)
#endif

int data[30][30];
int h;


int dell(int data[30][30]){
	int ret=0;
	rep(i,h){
		rep(j,3){
			int num=1;
			rep(k,5){
				if(j+k>=5)break;
				if( data[i][j+k]!=-1 && data[i][j+k]==data[i][j+k+1])num++;
				else break;
			}
			if(num>=3){
				rep( k,num ){
					data[i][k+j]=-1;
				}
				ret++;
			}
		}
	}
	return ret;
}


void fall(int data[30][30]){
	rep(k,h){
	for(int i=h-1;i>=1;i--){
		rep(j,5){
			if(data[i][j]==-1)swap(data[i][j],data[i-1][j]);
		}
	}
	}
}


int main(){
	while(cin>>h){
		if(h==0)break;
		int bef=0;
		rep(i,h)
			rep(j,5){
				cin>>data[i][j];
				bef+=data[i][j];
			}
		while(1){
			if( dell(data)==0 )break;
			fall(data);
		}

		int af=0;
		rep(i,h)rep(j,5)if(data[i][j]!=-1)af+=data[i][j];

		cout<<bef-af<<endl;


	}
}

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;
}