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 _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;

vector<vector<int>> refresh(vector<vector<int>> b, int h){
    vector<vector<int>> ret(h, vector<int>(5, 0));
    rep(j, 5){
        vector<int> nonzero;
        for(int i = h-1; i >= 0; --i){
            if(b[i][j] != 0) nonzero.push_back(b[i][j]);
        }

        rep(i, nonzero.size()){
            ret[h-i-1][j] = nonzero[i];
        }

    }

    return ret;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    while(1){
        int h;
        cin >> h;

        if(h == 0) break;

        vector<vector<int>> b(h, vector<int>(5));
        rep(i, h) rep(j, 5) cin >> b[i][j];

        int res = 0;
        while(1){

            int r_sm = 0;
            rep(i, h){

                int sm = 0;
                if(b[i][0]==b[i][1] && b[i][1]==b[i][2] && b[i][2]==b[i][3] && b[i][3]==b[i][4]){
                    sm += b[i][0] * 5;
                    rep(j, 5) b[i][j] = 0;
                }

                else if((b[i][0]==b[i][1] && b[i][1]==b[i][2] && b[i][2]==b[i][3]) || (b[i][1]==b[i][2] && b[i][2]==b[i][3] && b[i][3]==b[i][4])){
                    if(b[i][0] == b[i][1]){
                        sm += b[i][0] * 4;
                        rep(j, 4) b[i][j] = 0;
                    }
                    else{
                        sm += b[i][1] * 4;
                        rep1(j, 5) b[i][j] =0;
                    }
                }

                else if((b[i][0]==b[i][1] && b[i][1]==b[i][2]) || (b[i][1]==b[i][2] && b[i][2]==b[i][3]) || (b[i][2]==b[i][3] && b[i][3]==b[i][4])){
                    if(b[i][0] == b[i][1] && b[i][1]==b[i][2]){
                        sm += b[i][0] * 3;
                        rep(j, 3) b[i][j] = 0;
                    }
                    else if(b[i][2]==b[i][3] && b[i][3] == b[i][4]){
                        sm += b[i][2] * 3;
                        for(int j = 2; j < 5; ++j) b[i][j] = 0;
                    }
                    else{
                        sm += b[i][1] * 3;
                        rep1(j, 4) b[i][j] = 0;
                    }
                }

                r_sm += sm;

            }

            if(r_sm == 0) break;
            else{
                res += r_sm;

                // cout << endl;
                // rep(i, h){
                //     rep(j, 5) cout << b[i][j] << " ";
                //     cout << endl;
                // }

                b = refresh(b, h);
                // cout << endl;
                // rep(i, h){
                //     rep(j, 5) cout << b[i][j] << " ";
                //     cout << endl;
                // }
            }
        }

        cout << res << endl;
    }

    return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
//#define INF (1LL<<59)


int h;

void del(vector<vector<int>> &v){
    rep(i,h){
        rep(j,5){
            
            int base = v[i][j];
            if(base==0)continue;
            int num = 0;
            rep(k,5){
                if(j+k>5)break;
                if(base==v[i][j+k])num++;
                else break;
            }
            if(num<3)continue;
            rep(k,5){
                if(j+k>5)break;
                if(base==v[i][j+k]){
                    v[i][j+k]=0;
                }else break;
            }
            
        }
    }
}

bool fall(vector<vector<int>> &v){
    bool ret = false;
    for(int i=h-2;i>=0;i--){
        rep(j,5){
            if(v[i+1][j]==0 && v[i][j]!=0){
                ret|=true;
                swap(v[i+1][j],v[i][j]);
            }
        }
    }
    return ret;
}


int main(){
    while(cin>>h&&h){
        int sum = 0;
        vector<vector<int>> fie(h,vector<int>(5));
        rep(i,h){
            rep(j,5){
                cin>>fie[i][j];
                sum+=fie[i][j];
            }
        }
        
        while(1){
            del(fie);
            
            bool res = false;
            rep(i,h)res |= fall(fie);
            if(res==false)break;
        }
        int t = 0;
        rep(i,h){
            rep(j,5){
                t+=fie[i][j];
            }
        }
    
        cout<<sum-t<<endl;
    }
}