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 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;
                        }
                  }
                  drop();
            }
            cout<<ans<<endl;
      }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <array>
#include <climits>
#include <cassert>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX/3
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cout<<#x<<":"<<x<<endl
#define debug2(x,y) cout<<#x","<<#y":"<<x<<","<<y<<endl

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

void mv(vvi& t,int H){
    rep(c,H){
        for(int j=0;j<5;j++){
            for(int i=H-2;i>=0;i--){
                if(t[i+1][j]==0){
                    swap(t[i][j],t[i+1][j]);
                }
            }
        }
    }
}

bool check(vvi& t,int H){
    bool f=false;
    for(int i=0;i<H;i++){
        for(int j=0;j<5;j++){
            int cnt = 0;
            if(t[i][j]==0) continue;
            for(int k=j;k<5;k++){
                if(t[i][j]!=t[i][k]) break;
                cnt++;
            }
            if(cnt>=3){
                int n = t[i][j];
                for(int k=j;k<5;k++){
                    if(n!=t[i][k]) break;
                    t[i][k] = 0;
                }
                f=true;
                break;
            }
        }
    }
    mv(t,H);
    return f;
}

void solve(int H){
    vector<vector<int>> t(H,vi(5));
    int score=0;
    rep(i,H) rep(j,5) cin >> t[i][j];

    rep(i,H) rep(j,5) score += t[i][j];

    while(check(t,H)){
//        cout << endl;
//        rep(i,H){
//            rep(j,5) cout << t[i][j] << " ";
//            cout << endl;
//        }
    }
    
    rep(i,H) rep(j,5) score -= t[i][j];
    cout << score << endl;
}

int main(){
    int H;
    while(cin>>H){
        if(H==0) break;
        solve(H);
    }
}

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

#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)
#define minit(a, b) memset(a, b, sizeof(a))

int H, board[11][6];
const int NIL = -1;

bool fall(int x, int y) {
	if (board[y][x] == NIL) return false;
	
	if (board[y-1][x] == NIL) {
		board[y-1][x] = board[y][x];
		board[y][x] = NIL;
		return true;
	}
	
	return false;
}

void erase(int x, int y, int len) {
	for_(xx,x,x+len) board[y][xx] = NIL;
}

int vanish(int y) {
	int x = 0, cur = board[y][0], len = 1;
	
	while (x <= 2) {
		if (cur != NIL) {
			while (cur == board[y][x+len]) ++len;
		}
		
		if (len >= 3) break;
		x += len;
		cur = board[y][x];
		len = 1;
	}
	
	if (len < 3) return 0;
	erase(x, y, len);
	return cur * len;
}

void solve() {
	int score = 0;
	
	while (1) {
		int add = 0;
		
		for_(y,0,H) add += vanish(y);
		
		for_(y,1,H) {
			for_(x,0,5) {
				if (fall(x, y)) {
					y = 0;
					break;
				}
			}
		}
		
		if (add == 0) break;
		score += add;
	}
	
	cout << score << endl;
}

int main() {
	while (cin >> H, H) {
		minit(board, NIL);
		for_rev(y,H-1,0) for_(x,0,5) cin >> board[y][x];
		solve();
	}
}