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>
using namespace std;

void dispStone(int stone[][5]){
	for(int i=9;i>=0;i--){
		for(int j=0;j<5;j++){
			cout<<stone[i][j];
		}
		cout<<endl;
	}
	cout<<endl;
}

bool isStoneDrop(int stone[][5]){
	for(int i=0;i<5;i++){
		bool flg=true;
		for(int j=0;j<10;j++){
			if(stone[j][i]==0) flg=false;
			else if(flg==false && stone[j][i]!=0) return true;
		}
	}
	return false; //これ以上落ちない
}
void drop(int stone[][5]){
	while(isStoneDrop(stone)){
		for(int i=0;i<9;i++){
			for(int j=0;j<5;j++){
				if(stone[i][j]==0 && stone[i+1][j]!=0){
					stone[i][j]=stone[i+1][j];
					stone[i+1][j]=0;
				}
			}
		}
	}
}
bool isStone(int *stone_line){
	for(int i=0;i<5;i++){
		if(stone_line[i]!=0){
			return true;
		}
	}
	return false;
}
int checkLine(int *stone_line){
	int point=0;
	int chain=0;
	for(int i=0;i<4;i++){
		if(chain>1 && stone_line[i]!=stone_line[i+1]){
			for(;chain>=0;chain--){
				point+=stone_line[i-chain];
				stone_line[i-chain]=0;
			}
			return point;
		}else if(stone_line[i]==stone_line[i+1]){
			chain++;
		}else{
			chain=0;
		}
	}
	if(chain>1){
		for(chain;chain>=0;chain--){
			point+=stone_line[4-chain];
			stone_line[4-chain]=0;
		}	
			return point;
	}else{
		return 0;
	}
}
int erase(int stone[][5]){
	int point=0,i=0;
	while(isStone(stone[i])){
		point+=checkLine(stone[i]);
		i++;
	}
	return point;
}


int main(){
	int h;
	cin>>h;
	while(h!=0){
		int point=0;
		int stone[10][5]={};
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				cin>>stone[h-i-1][j];
			}
		}
		while(1){
			if(int p=erase(stone)){
				point+=p;
//dispStone(stone);
			}else{
				break;
			}
			drop(stone);
//dispStone(stone);
		}
		cout<<point<<endl;
		cin>>h;
	}

	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
while(true){
 int H;
 cin>>H;

 if(H==0)break;

 int S[10][5];
 for(int y=0;y<H;y++)
	for(int x=0;x<5;x++)
		cin>>S[y][x];

 int sco=0;
 
 while(true){
	bool flg=false;

	for(int y=0;y<H;y++){
		int m =S[y][2];//真ん中覚える
		if(m==0)
			continue;

		if(S[y][0]==m && S[y][1]==m){//012で消える
			sco += m*3;
			S[y][0]=S[y][1]=S[y][2]=0;
			flg==true;
			if(S[y][3]==m){
				sco+=m;
				S[y][3]=0;
				if(S[y][4]==m){
					sco+=m;
					S[y][4]=0;
				}
			}
		}
		else if(S[y][1]==m&&S[y][3]==m){//1~3
			sco+=m*3;
			S[y][1]=S[y][2]=S[y][3]=0;
			flg=true;
			if(S[y][4]==m){
				sco+=m;
				S[y][4]=0;
			}
		}
		else if(S[y][3]==m&&S[y][4]==m){//2~4
			sco+=m*3;
			S[y][2]=S[y][3]=S[y][4]=0;
			flg=true;
		}
	}
	if(!flg)break;

	for(int x=0;x<5;x++){
		for(int y=H-1;y>=0;y--){
			if(S[y][x]!=0)
				continue;
			for(int y2=y-1;y2>=0;y2--){
				if(S[y2][x]!=0){
					S[y][x]=S[y2][x];
					S[y2][x]=0;
					break;
				}
			}
		}
	}
 }
 cout<<sco<<endl;
}
return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define range(i,a,n) for(int i=(a);i<(n);i++)

#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384

int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};

template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}

ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}

void solve(int n){
	int ans=0;
	vvi v(n+1,vi(5));
	rrep(i,n)rep(j,5)cin>>v[i][j];
	bool loop=true;
	while(loop){
		loop=false;
		rep(i,n){
			rep(j,3){
				if(v[i][j]&&v[i][j]==v[i][j+1]&&v[i][j]==v[i][j+2]){
					int t=v[i][j];
					range(k,j,5){
						if(v[i][k]==t){
							v[i][k]=0;
							ans+=t;
							loop=true;
						}
						else break;
					}
				}
			}
		}
		rep(j,5){
			int cnt=0;
			rep(i,n){
				if(v[i][j]==0)cnt++;
				else {
					v[i-cnt][j]=v[i][j];
					if(cnt)v[i][j]=0;
				}
			}
		}
	}
	cout<<ans<<endl;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	while(cin>>n,n)solve(n);
}