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 <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
//#include <bits/stdc++.h>

#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n");
#define mod 1000000007

using namespace std;

void move(vector<vector<int>> &stn, int num)
{
	rep(i, num)
	{
		rep(j, 5)
		{
			if (stn[i][j] == 0)
			{
				stn[i][j] = stn[i + 1][j];
				stn[i + 1][j] = 0;
			}
		}
	}
}
int check(vector<vector<int>> &stn, int num)
{
	int poi = 0;
	rep(i, num)
	{
		int tmp = 0;
		rep(j, 3)
		{
			if (stn[i][j] == stn[i][j + 1] && stn[i][j + 1] == stn[i][j + 2])
			{
				tmp += stn[i][j] * 3;
				if (j < 2 && stn[i][j + 2] == stn[i][j + 3])
				{
					if (j == 0 && stn[i][j + 3] == stn[i][j + 4])
					{
						tmp += stn[i][j + 4];
						stn[i][j + 4] = 0;
					}
					tmp += stn[i][j + 3];
					stn[i][j + 3] = 0;
				}
				stn[i][j] = 0, stn[i][j + 1] = 0,	stn[i][j + 2] = 0;
			}
		}
		poi += tmp;
	}
	return poi;
}

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int num = 0;
	while (cin >> num && num != 0)
	{
		vector< vector<int> > stn(num + 1, vector<int>(5));
		rep(i, num) { cin >> stn[num - i - 1][0] >> stn[num - i - 1][1] >> stn[num - i - 1][2] >> stn[num - i - 1][3] >> stn[num - i - 1][4]; }
		int ans = 0, tmp = 0;
		rep(i, 10)
		{
			ans += check(stn, num);
			rep(i, 10) { move(stn, num); }
		}
		printf("%d\n", ans);
	}
	return 0;
}

C++: #include <iostream>
#include <vector>

using namespace std;

#define W 5

int main(){
    while(true){
        int h;
        cin >> h;
        if(h==0)break;
    vector<vector<int> > map(h,vector<int>(W,0));
    for(int i=0;i<h;i++)
    for(int j=0;j<W;j++){
        cin >> map[i][j];
    }
    bool flag=true;
    int ans=0;
    do{
        flag=false;
        for(int i=0;i<h;i++)
        for(int j=0;j<W;j++){
            if(map[i][j]==-1)continue;

            int seg;
            for(seg=1;j+seg<W;seg++){
                if(map[i][j]!=map[i][j+seg])break;
            }
            if(seg>=3){
                for(int k=0;k<seg;k++){
                    flag=true;
                    ans += map[i][j+k];
                    map[i][j+k] = -1;
                }
            }
        }
        for(int k=0;k<h;k++){
            for(int i=1;i<h;i++){
                for(int j=0;j<W;j++){
                    if(map[i][j]==-1){
                        int tmp = map[i][j];
                        map[i][j]=map[i-1][j];
                        map[i-1][j]=tmp;
                    }
                    
                }
            }
        }

    }while(flag);
    cout << ans << endl;
    }
  return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

void solve(int H) {
        int i, j;
        vector<vector<int> > block(H, vector<int> (5));
        for (i = H - 1; i >= 0; i --) {
                for (j = 0; j < 5; j ++) {
                        cin >> block[i][j];
                }
        }
        int ans = 0;
        for (int l = 0; l < 100; l ++) {
                for (i = 0; i < H; i ++) {
                        int p = block[i][2];
                        int l = 1, r = 3;
                        while (block[i][l] == p) l --;
                        while (block[i][r] == p) r ++;
                        l ++, r --;
                        if (r - l + 1 >= 3) { 
                                for (j = l; j < r + 1; j ++) block[i][j] = 0;
                                ans += p * (r - l + 1);
                        }
                }
                for (i = 0; i < 5; i ++) {
                        for (int k = 0; k < 10; k ++) {
                                for (j = 0; j < H; j ++) {
                                        if (block[j][i] == 0 && j != H - 1) {
                                                swap(block[j][i], block[j + 1][i]);
                                        }
                                }
                        }
                }
        }
        cout << ans << endl;
}

int main() {
        int H;
        while (cin >> H) {
                if (H == 0) break;
                solve(H);
        }
        return 0;
}