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;

int main(){
    int h;
    while(cin>>h){
        if(h==0) return 0;
        int ans=0;
        int s[11][5];
        for (int i = 0; i < h; i++)for(int j=0;j<5;j++)
        {
            cin>>s[i][j];
        }
        int ff=0;
        bool flag=true;
        while(flag){
            flag=false;
            int l=0,r=0;
            for(int i=0;i<h;i++){
                l=0,r=0;
                for(int j=1;j<5;j++){
                    if(s[i][j]!=0 && s[i][j]==s[i][j-1]) r=j;
                    else {
                        if(r-l>=2){
                            flag=true;
                            ans+=(int)(r-l+1)*(s[i][r]);
                            for(int k=i;k>0;k--){
                                for(int h=l;h<=r;h++){
                                    s[k][h]=s[k-1][h];
                                }
                            }
                            for(int h=l;h<=r;h++) s[0][h]=0;
                        }
                        l=j;
                    }
                }
                //r=4;
                if(4-l>=2){
                    flag=true;
                    ans+=(int)(4-l+1)*(s[i][4]);
                    for(int k=i;k>0;k--){
                        for(int h=l;h<=r;h++){  
                            s[k][h]=s[k-1][h];
                        }
                    }
                    for(int h=l;h<=r;h++) s[0][h]=0;
                }
            }
            //cerr<<l<<" "<<r<<endl;
        }
        /*cerr<<endl;
        for(int i=0;i<h;i++){
            for(int j=0;j<5;j++)cerr<<s[i][j]<<" ";
            cerr<<endl;
        }*/

        cout<<ans<<endl;
        
    }
}

C++: //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;

int main() {
    while(1) {
        int h;
        cin >> h;
        if(!h) break;
        vector<queue<int> > qq(5);
        vector<stack<int> > qqq(5);
        rep(i, h) {
            int a, s, d, f, g;
            cin >> a >> s >> d >> f >> g;
            qqq[0].push(a);
            qqq[1].push(s);
            qqq[2].push(d);
            qqq[3].push(f);
            qqq[4].push(g);
        }
        rep(j, h) {
            rep(i, 5) {
                qq[i].push(qqq[i].top());
                qqq[i].pop();
            }
        }

        int ans = 0;

        while(1) {
            int ssi = qq.size();
            bool hantei = true;
            bool up = false;
            
            vi ssum(5);
            rep(i, h) {
                vi num(10);
                rep(j, ssi) {
                    if(qq[j].front() == 1000) continue;
                    num[qq[j].front()]++;
                }
                int gg = -1;
                rep(j, 10) {
                    if(num[j] > 2) {
                        gg = j;
                        break;
                    }
                }
                if(!((qq[0].front() == qq[1].front() && qq[2].front() == qq[1].front()) || (qq[2].front() == qq[1].front() && qq[2].front() == qq[3].front()) || (qq[4].front() == qq[3].front() && qq[2].front() == qq[4].front()))) {
                    gg = -1;
                }
                if(gg != -1) {
                    ans += gg * num[gg];
                    if(num[gg] == 4 && (qq[1].front() != gg)) {
                        ans -= gg;
                        qq[0].push(qq[0].front());
                    }
                    if(num[gg] == 4 && (qq[3].front() != gg)) {
                        ans -= gg;
                        qq[4].push(qq[4].front());
                    }
                }
                rep(j, ssi) {
                    int bb = qq[j].front();
                    qq[j].pop();
                    if(gg != bb) {
                        qq[j].push(bb);
                    } else {
                        if(qq[j].size() == h) continue;
                        ssum[j]++;
                        up = true;
                    }
                }
            }
            rep(i, 5) {
                rep(j, ssum[i]) {
                    qq[i].push(1000);
                }
            }
            if(!up) hantei = false;
            if(!hantei) break;
        }

        
        cout << ans << '\n';
    }
}