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 <bits/stdc++.h>
using namespace std;
#define rep1(i,n) for(int i=1;i<=n;++i)
#define repr(i,n) for(int i=n;i>0;--i)
#define W 5

int main(void){
    int a[11][W+2]={};
    int cnt=1,score,H;

    while(cin>>H, H){
        score=0;
        rep1(j,H)rep1(i,W)cin>>a[j][i];

        while(1){
            bool combo=false;

            /*???????¶???????????????¢????????????*/
            repr(j,H){
                rep1(i,W){
                    //????????§???????????¨????????????
                    if(a[j][i] && (a[j][i]==a[j][i+1]))++cnt;
                    else{
                        if(cnt>=3){
                            score+=a[j][i]*cnt;
                            combo=true;
                            //?¶????????????¨?????????0?????\??????
                            while(cnt--)a[j][i-cnt]=0;
                        }
                        cnt=1;
                    }
                }
            }

            if(!combo || H==1)break;

            /*????????????*/
            repr(j,H){
                rep1(i,W){
                    if(!a[j][i]){
                        repr(k,j-1){
                            if(a[k][i]){
                                a[j][i]=a[k][i];
                                a[k][i]=0;
                                break;
                            }
                        }
                    }
                }
            }
        }
        cout<<score<<endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
#define all(a) (a).begin(), (a).end()

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

int main(){
	int n;
	while(cin >> n, n){
		vector<vector<int> > v(n);
		for(int i=0; i< n; i++){
			for(int j=0; j < 5; j++){
				int m; cin >> m; v[i].push_back(m);
			}
		}
		int ret = 0;

		while(true){
			bool p = false;
			for(int i=0; i < n; i++){
				for(int j=0; j< 3; j++){
					if(v[i][j] == -1) continue;
					int count = 0;
					while(v[i][j] == v[i][j+count] && j+count < 5) count++;
					if(3 <= count){
						p = true; ret += v[i][j]*count;
						rep(k, 3) v[i][j+k] = -1;
					}
				}
			}
			if(!p) break;
			else {
				for(int i=n-1; 1 <= i; i--){
					for(int j=0; j< 5; j++){
						if(v[i][j] == -1){
							for(int k =0; 0 <= i-k; k++) if(v[i-k][j] != -1){
								v[i][j] = v[i-k][j]; v[i-k][j] = -1; break;
							}
						}
					}
				}
			}
		}
		cout << ret << endl;
	}
}

C++: #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cmath>
#include<cstdint>
//#include<>
using namespace std;

typedef int64_t i64;typedef int32_t i32;
typedef int16_t i16;typedef int8_t i8;
typedef uint64_t ui64;typedef uint32_t ui32;
typedef uint16_t ui16;typedef uint8_t ui8;

typedef i32 int__;
#define rep(i,j) for(int__ i=0;i<j;i++)
#define repeat(i,j,k) for(int__ i=(j);i<(k);i++)
#define repeat_eq(i,j,k) for(int__ i=(j);i<=(k);i++)
#define all(v) begin(v),end(v)

const i32 INF=1<<30;//=10E10
int h;

void drop(vector< vector<int> > &vv ){
  rep(y,h-1){
    rep(x,5){
      while(vv[y][x]==-1){
	for(int yy=y;yy<h-1;yy++){
	  vv[yy][x]=vv[yy+1][x];
	}
	vv[h-1][x]=-3;
      }
    }
  }
};

int del( vector< vector<int> > &vv){
  int ans=0;
  rep(y,h){
    int seq=0,pre=-2;
    int i;
    for(i=0;i<5;i++){
      if(pre==vv[y][i])++seq;
      else{
	if(seq>=3)break;
	seq=1;
	if(vv[y][i]!=-1 && vv[y][i]!=-3)
	  pre=vv[y][i];
	else
	  pre=-2;
      }
    }
    if(seq>=3){
      rep(j,seq){
	vv[y][i-j-1]=-1;
      }
      ans+=seq*pre;
    }
  }
  return ans;
}

int main()
{
  while(true){
    cin>>h;
    if(h==0)break;

    vector< vector<int> > pazzle(h,vector<int>(5,-1));

    rep(i,h){
      rep(j,5)
	cin>>pazzle[h-i-1][j];
    }
    
    int ans=0;
    int scr=0;
    while( (scr=del(pazzle)) >0 ){
      ans+=scr;
      drop(pazzle);
    }
    cout<<ans<<endl;
  }
  return 0;
}