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;
#define FOR(i,bg,ed) for(int i=bg;i<ed;i++)
#define REP(i,n) FOR(i,0,n)

typedef pair<int,int> p;
const int INF =1e5;
int R,C=5;
p b[100][100];
bool nb[100][100];
bool f(){
 bool ret = false;
 FOR(i,1,C-1)REP(j,R){
   nb[i][j]=false;
   if(b[i][j].first == INF)continue;
   if(b[i][j].second == b[i-1][j].second)
   if(b[i][j].second == b[i+1][j].second)
     ret = nb[i][j]=true;
 }
 FOR(i,1,C-1)REP(j,R){
    if(nb[i][j]){
       b[i-1][j]={INF,-1};
       b[i][j]={INF,-1};
       b[i+1][j]={INF,-1};   	   
   	}
 }
 REP(i,C){
   sort(b[i],b[i]+R); 
 }
 return ret;
}
int main(){
  while(cin>>R,R){
   REP(i,R)REP(j,C){
     int val;
     cin>>val;
     b[j][R-i-1]={R-i-1,val};
   }
   int ret = 0;
   REP(i,C)REP(j,R)if(b[i][j].second>-1)ret+=b[i][j].second;
   while(f());
   REP(i,C)REP(j,R)if(b[i][j].second>-1)ret-=b[i][j].second;
   cout<<ret<<endl;
  }
  
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <functional>
#include <array>
#include <queue>

using namespace std;

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

        vector<vector<int>> vec(H, vector<int>(5));
        for(int i = 0; i < H; ++i) for(int j = 0; j < 5; ++j){
            cin >> vec[i][j];
        }

        int ans = 0;
        bool changed = true;
        while(changed){
            changed = false;
            for(int i = 0; i < H; ++i){
                for(int j = 0; j <= 2; ++j){
                    int num = vec[i][j];
                    if(num == 0) continue;
                    int same = 0;
                    for(int k = j + 1; k < 5; ++k){
                        if(num != vec[i][k]){
                            break;
                        }
                        same = k - j + 1;
                    }
                    if(same >= 3){
                        changed = true;
                        ans += num * same;
                        for(int k = 0; k < same; ++k){
                            vec[i][j + k] = 0;
                        }
                    }
                }
            }
            for(int i = H - 1; i > 0; --i){
                for(int j = 0; j < 5; ++j){
                    if(vec[i][j] == 0){
                        for(int k = i; k >= 0; --k){
                            if(vec[k][j] != 0){
                                vec[i][j] = vec[k][j];
                                vec[k][j] = 0;
                                break;
                            }
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define chmin(a,b) (a)=min((a),(b));
#define chmax(a,b) (a)=max((a),(b));
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define printV(v) cerr<<(#v)<<":";for(auto(x):(v)){cerr<<" "<<(x);}cerr<<endl;
#define printVS(vs) cerr<<(#vs)<<":"<<endl;for(auto(s):(vs)){cerr<<(s)<< endl;}
#define printVV(vv) cerr<<(#vv)<<":"<<endl;for(auto(v):(vv)){for(auto(x):(v)){cerr<<" "<<(x);}cerr<<endl;}
#define printP(p) cerr<<(#p)<<(p).first<<" "<<(p).second<<endl;
#define printVP(vp) cerr<<(#vp)<<":"<<endl;for(auto(p):(vp)){cerr<<(p).first<<" "<<(p).second<<endl;}

inline void output(){ cerr << endl; }
template<typename First, typename... Rest>
inline void output(const First& first, const Rest&... rest) {
    cerr << first << " "; output(rest...);
}

using ll = long long;
using Pii = pair<int, int>;
using TUPLE = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const int inf = 1ll << 60;
const int mod = 1e9 + 7;
using Graph = vector<vector<int>>;

int h;
int w = 5;
vvi a;

void fall() {
    for (int i = h - 1; i > 0; i--) {
        rep(j, w) {
            if (a[i][j]) continue;
            int k = i;
            while (k >= 0 && !a[k][j]) {
                k--;
            }
            if (k >= 0) {
                a[i][j] = a[k][j];
                a[k][j] = 0;
            }
        }
    }
}

int check() {
    int ret = 0;
    rep(i, h) {
        rep(j, w) {
            if (!a[i][j]) continue;
            int l = 0;
            while (j + l < w && a[i][j] == a[i][j + l]) {
                l++;
            }
            if (l >= 3) {
                rep2(k, j, j + l) {
                    ret += a[i][k];
                    a[i][k] = 0;
                }
            }
        }
    }

    fall();

    return ret;
}

void solve() {
    a.clear();
    a.resize(h);
    rep(i, h) a[i].resize(w);
    rep(i, h) rep(j, w) cin >> a[i][j];

    int ans = 0;
    int t;
    // printVV(a);
    while (true) {
        t = check();
        // printVV(a);
        if (!t) break;
        ans += t;
    }

    cout << ans << endl;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    while (cin >> h, h) solve();
}