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<algorithm>
using namespace std;
int map[20][5];
int h,ans;
void DFS(){
	bool move=false;
	for(int i=0;i<h;i++){
		int cnt=0,set=0;
		for(int j=0;j<5;j++){
			if(map[i][j]!=set){
				if(cnt>=3&&set!=0){
					for(int k=0;k<cnt;k++){
						ans+=map[i][j-k-1];
						map[i][j-k-1]=0;
					}
					//cout<<"$"<<set<<" "<<cnt<<endl;
					move=true;
				}
				cnt=1;
				set=map[i][j];
			}
			else cnt++;
		}
		if(cnt>=3&&set!=0){
			for(int k=0;k<cnt;k++){
				ans+=map[i][4-k];
				map[i][4-k]=0;
			}
			//cout<<"$"<<set<<" "<<cnt<<endl;
			move=true;
		}
	}
	for(int k=0;k<h;k++){
	for(int j=0;j<5;j++){
		for(int i=h-1;i>0;i--){
			if(map[i-1][j]==0){
				int tmp=map[i][j];
				map[i][j]=0;
				map[i-1][j]=tmp;
			}
		}
	}
	}
	if(move)DFS();
}
int main(){
	while(true){
	cin>>h;
	if(h==0)break;
	for(int i=0;i<h;i++){
		for(int j=0;j<5;j++){
			cin>>map[h-i-1][j];
		}
	}
	ans=0;
	DFS();
	cout<<ans<<endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int h;
  while(cin>>h,h){
    int a[10][5],ans=0;
    for(int i=0;i<h;i++)
      for(int j=0;j<5;j++)cin>>a[i][j];
    bool f=1;
    while(f){
      f=0;
      for(int i=0;i<h;i++){
	int c=1,p=0;
	for(int j=1;j<5;j++)
	  if(a[i][p]==a[i][j])c++;
	  else if(c<3)c=1,p=j;
	  else break;
	if(c>=3){
	  ans+=c*a[i][p];
	  for(int k=0;k<c;k++)a[i][p+k]=0;
	}
      }
      for(int i=0;i<5;i++)
	for(int j=1;j<h;j++)
	  for(int k=j;k>0;k--)
	    if(!a[k][i]&&a[k-1][i])swap(a[k][i],a[k-1][i]),f=1;
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int h,a[11][5];
main()
{
	while(cin>>h,h)
	{
		for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>a[i][j];
		int ans=0;
		bool flag=1;
		while(flag)
		{
			flag=0;
			for(int i=0;i<h;i++)
			{
				for(int j=0;j<3;j++)
				{
					if(a[i][j]&&a[i][j]==a[i][j+1]&&a[i][j]==a[i][j+2])
					{
						ans+=a[i][j]*3;
						flag=1;
						if(j+3<5&&a[i][j]==a[i][j+3])ans+=a[i][j],a[i][j+3]=0;
						if(j+4<5&&a[i][j]==a[i][j+4])ans+=a[i][j],a[i][j+4]=0;
						a[i][j]=a[i][j+1]=a[i][j+2]=0;
					}
				}
			}
			for(int j=0;j<5;j++)
			{
				for(int i=h;i-->0;)
				{
					if(a[i][j]==0)
					{
						int k;
						for(k=i-1;k>=0&&a[k][j]==0;k--);
						if(k<0)break;
						a[i][j]=a[k][j];
						a[k][j]=0;
					}
				}
			}
		}
		cout<<ans<<endl;
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;

int cnt(vector< vector<int> > a){
    int res=0;
    while(true){
        
        bool flag=false;
        REP(i,a.size()){
            int c=a[i][0];
            int cnt=0;
            int maxcnt=0;
            int maxc=-1;
            REP(j,5){
                if(c!=a[i][j]){
                    cnt=1;
                    c=a[i][j];
                }else{
                    cnt++;
                }
                if(maxcnt<cnt){
                    maxcnt=cnt;
                    maxc=c;
                }
            }
            if(maxcnt>=3 && maxc!=0){
                flag=true;
                REP(j,5){
                    if(a[i][j]==maxc)a[i][j]=0;
                }
                res+=maxcnt*maxc;
            }
        }
    
        if(!flag)break;
        
        int cnt=0;
        for(int i=(int)a.size()-1;i>=0;){
            REP(j,5){
                if(a[i][j]==0){
                    for(int k=i-1;k>=0;k--){
                        a[k+1][j]=a[k][j];
                        if(k==0)a[k][j]=0;
                    }
                }
            }
            if(cnt>12){
                cnt=0;
                i--;
            }
            cnt++;
        }
    }
    return res;
}

int main(){
    
    while(true){
        int n; cin>>n;
        if(n==0)break;
        vector< vector<int> > a(n,vector<int>(5));
        REP(i,n)REP(j,5)cin>>a[i][j];
        cout<<cnt(a)<<endl;
    }
    
    return 0;
}