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 <iostream>
#include <vector>
using namespace std;
int main(){
  int H, h, b, e;
  while (cin >> H, H){
    int C[H][5], ans = 0;
    for (int i = 0; i < H; ++i){
      for (int j = 0; j < 5; ++j){
	cin >> C[H-1-i][j];
      }
    }
    bool f = true;
    vector< vector<int> > V;
    while (f){
      f = false;
      for (int i = 0; i < H; ++i){
	b = 0;
	e = 0;
	for (int j = 1; j < 5; ++j){
	  if (C[i][j] && C[i][j-1] == C[i][j]){
	    e = j;
	  }else{
	    if (e - b > 1){
	      f = true;
	      V.push_back({i,b,e});
	    }
	    b = j;
	    e = j;
	  }
	}
	if (e - b > 1){
	  f = true;
	  V.push_back({i,b,e});
	}
      }
      while (!V.empty()){
	h = V.back()[0];
	b = V.back()[1];
	e = V.back()[2];
	V.pop_back();
	ans += C[h][b]*(e-b+1);
	for (int i = h; i < H; ++i){
	  for (int j = b; j <= e; ++j){
	    if (i+1 < H){
	      C[i][j] = C[i+1][j];
	    }else{
	      C[i][j] = 0;
	    }
	  }
	}
      }
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, s, n) for (signed i = (s); i < signed(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

const double EPS = 1e-9;

template<typename Func>
double search(double left, double right, Func f) {
	for (int loop = 0; loop < 100000; ++loop) {
		if (f((left * 2 + right) / 3) < f((left + right * 2) / 3)) {
			right = (left + right * 2) / 3;
		} else {
			left = (left * 2 + right) / 3;
		}
	}
	return (right + left) * 0.5;
}

signed main() {
	int h;
	while (cin >> h && h) {
		VV board(h, V(5));
		rep(i, h) rep(j, 5) cin >> board[i][j];
		int score = 0;

		while (true) {
			int added = 0;
			VV next = board;
			rep(i, h) rep(j, 3) {
				if (board[i][j] == board[i][j + 1] && board[i][j] == board[i][j + 2]) {
					added += next[i][j] + next[i][j + 1] + next[i][j + 2];
					next[i][j] = next[i][j + 1] = next[i][j + 2] = 0;
				}
			}
			score += added;
			board = move(next);
			if (added != 0) break;
		}

		cout << score << endl;
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back 
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int data[5][11];
int n;

void ShowaBan(){
	REP(i,n){
		REP(j,5){
			cout << data[j][i] << " ";
		}
		cout << endl;
	}
	cout << endl;
}

int solve(){
	int res = 0;
	REP(i,n){
		int lt = 2;
		int rt = 2;
		while(lt>=0){
			if(data[lt][i]==data[2][i]) lt--;
			else {
				lt++;
				break;
			}
		}
		while(rt<=4){
			if(data[rt][i]==data[2][i]) rt++;
			else {
				rt--;
				break;
			}
		}
		if(rt==5) rt=4;
		if(lt==-1) lt = 0;
		int num = rt-lt+1;
		if(num>=3){
			res += num*data[2][i];
			FOR(j,lt,rt+1){
				data[j][i]=-1;
			}
		}
	}

	//ShowaBan();
	REP(j,5){
		queue<int> qt;
		for(int i=n-1;i>-1;i--){
			if(data[j][i]!=-1) qt.push(data[j][i]);
		}
		REP(i,11) data[j][i] = 0;
		int t = n-1;
		while(!qt.empty()){
			data[j][t] = qt.front();
			qt.pop();
			t--;
		}

	}

	//ShowaBan();
	return res;
}
int main(){

	while(1){
		cin >> n;
		if(n==0) break;
		REP(i,5)REP(j,11) data[i][j] = 0;
		REP(i,n)REP(j,5) cin >> data[j][i];
		ll int ans = 0;
		while(1){
			int tmp = solve();
			if(tmp<=0) break;
			ans += tmp;
		}
		cout << ans << endl;
	}
}