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>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
	int h;
	while (cin >> h, h) {
		vector<int>V[5];
		rep(i, h) {
			rep(j, 5) {
				int d; cin >> d;
				V[j].push_back(d);
			}
		}
		rep(i, 5)reverse(V[i].begin(), V[i].end());
		int ans = 0;bool update;
		do {
			update = 0;
			rep(i, h) {
				rep(j, 3) {
					int k;
					for (k = 0; j + k<5 && V[j + k].size()>i&&V[j][i] == V[j + k][i]; k++);
					if (k >= 3) {
						update = 1;
						ans += V[j][i]*k;
						rep(t, k)V[j + t][i] = 0;
					}
				}
			}
			rep(i, 5) {
				rep(j, V[i].size()) {
					if (!V[i][j]) {
						V[i].erase(V[i].begin() + j);
						j--;
					}
				}
			}
		} while (update);
		cout<<ans<<endl;
	}
}

C++: #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int H;
int fld[5][10];
void drop(){
      bool pp;
      REP(i,5){
            REP(j,H){
                  if(fld[i][j]==-1){
                        for(int k=j;k<H;k++){
                              if(fld[i][k]!=-1){
                                    swap(fld[i][k],fld[i][j]);
                                    break;
                              }
                        }
                  }
            }
      }
}
int main(){
      while(cin>>H&&H){
            for(int i=H-1;i>=0;i--)REP(j,5)cin>>fld[j][i];
            bool update=true;
            int ans=0;
            while(update){
                  update=false;
                  REP(i,H){
                        int s,e,j=0;bool change=false;
                        while(j<5){
                              if(fld[j][i]==-1){
                                    j++;
                                    continue;
                              }
                              s=j;
                              while(fld[s][i]==fld[j][i])j++;
                              if(j-s>=3){
                                    e=j;
                                    change=true;
                                    break;
                              }
                        }
                        if(change){
                              update=true;
                              ans+=(e-s)*fld[s][i];
                              for(int j=s;j<e;j++)fld[j][i]=-1;
                        }
                  }
                  //for(int i=H-1;i>=0;i--)REP(j,5)printf("%d%c",fld[j][i],j==4?'\n':' ');
                  //cout<<endl;
                  drop();
                  //for(int i=H-1;i>=0;i--)REP(j,5)printf("%d%c",fld[j][i],j==4?'\n':' ');
                  //cout<<ans<<endl;
                  //cout<<endl;
            }
            cout<<ans<<endl;
      }
}

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

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
 
typedef long long ll;
typedef pair<int, int> ii;

int main() {
	
	int h;
	while(cin >> h , h){
		
		vector<vector<int>> mp(h, vector<int>(5));
		
		for(int i = h-1; i >= 0; i--) rep(j, 5) cin >> mp[i][j];
		
		int ans = 0;
		bool f = true;
		while(f){
			f = false;
			rep(i, h){
				int cnt = 1;
				REP(j, 1, 5){
					if(mp[i][j] == mp[i][j - 1] && mp[i][j] > 0) cnt++;
					else{
						if(cnt >= 3){
							rep(k, cnt){
								ans += mp[i][j-1-k];
								mp[i][j-1-k] = -1;
								f = true;
							}
						}
						cnt = 1;
					}
				}
				if(cnt >= 3){
					rep(k, cnt){
						ans += mp[i][4-k];
						mp[i][4-k] = -1;
						f = true;
					}
				}
				
			}
			
			rep(i, h){
				rep(j, 5){
					if(mp[i][j] == -1){
						int tmp = 0;
						for(int k = 1; i + k < h; k++){
							if(mp[i+k][j] != -1){
								tmp = mp[i+k][j];
								mp[i+k][j] = -1;
								break;
							}
							mp[i+k][j] = -1;
						}
						
						mp[i][j] = tmp;
					}
				}
			}
		}
	
		cout << ans << endl;
		
	}
	
	
	return 0;
}