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<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double PI = 3.14159265358979;
const double E = 2.718281828459045;
const double root2 = sqrt(2);
typedef pair<int, int> P;
typedef unsigned int ui;
const ll key = 998244353;
int main() {
	int h;
	while (cin >> h, h) {
		int score = 0;
		int board[10][5];
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> board[i][j];
			}
		}
		while (true) {
			bool f = true;
			int del[10][5] = {};
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 5; j++) {
					if (board[i][j] == 0)continue;
					int cnt = 1; int k = 1;
					while (j + k < 5 && board[i][j + k] == board[i][j]) {
						k++; cnt++;
					}
					k = -1;
					while (j + k >= 0 && board[i][j + k] == board[i][j]) {
						k--; cnt++;
					}
					if (cnt >= 3) {
						del[i][j] = 1;
						f = false;
					}
				}
			}
			if (f)break;
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 5; j++) {
					if (del[i][j] == 1) {
						score += board[i][j];
						board[i][j] = 0;
					}
				}
			}
			for (int roo = 0; roo < h; roo++) {
				for (int j = 0; j < 5; j++) {
					for (int i = 0; i < h-1; i++) {
						if (board[i + 1][j] == 0) {
							swap(board[i][j], board[i + 1][j]);
						}
					}
				}
			}
		}
		cout << score << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int map[10][5];
int h,w=5;

int chain(int y,int x,int p,int *cnt){
  int ans=0;
  if(x+1<w && map[y][x+1]==p &&p>0  ){
    (*cnt)++;
    ans=max(ans,chain(y,x+1,p,cnt));
  }
  if(*cnt>=3){
    map[y][x]=0;
    ans=*cnt;
    return ans*p;
  }
  return ans;
    
}

void dlt(){
    while(1){
    int f=0;
    for(int i=h-1;i>=0;i--)
      for(int j=w-1;j>=0;j--){
	if(map[i][j]==0 && i-1>=0)swap(map[i][j],map[i-1][j]);
	else if(map[i][j]==0)map[i][j]=-1;
      }
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++) if(map[i][j]==0)f=1;
    if(f==0) break;
  }
  
}

int main(){
  while(1){
  int ans=0,ansf=0;
  int cnt;
  cin>>h;
  if(h==0) break;
  for(int i=0;i<h;i++)for(int j=0;j<w;j++)cin>>map[i][j];
  while(1){
    for(int i=0;i<h;i++)      
      for(int j=0;j<w;j++){
	cnt=1;
	ans+=chain(i,j,map[i][j],&cnt);
      }
    if(ansf==ans) break;
    ansf=ans;
    dlt();
  }
   cout<<ans<<endl;
  }
  return 0;
}