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 rep(i,n) for(int i=0;i<n;i++)

int h,b[10][5],a,e;

int main(){
	while(scanf("%d",&h),h){
		a=0;
		memset(b,0,sizeof(b));
		rep(i,h)rep(j,5)scanf("%d",b[i]+j);
		e=0;
		while(!e){
			e=1;
			for(int i=h-1;i>=0;i--)rep(j,3){
				int k=j;
				if(b[i][j]){
					while(k+1<5&&b[i][j]==b[i][k+1])k++;
					if(k-j>=2){
						a+=(k-j+1)*b[i][j];
						for(int v=j;v<=k;v++)b[i][v]=0;
					}
				}
			}
			for(int i=h-1;i>=0;i--)rep(j,5)if(!b[i][j])for(int k=i-1;k>=0;k--)if(b[k][j]){
				b[i][j]=b[k][j];b[k][j]=0;e=0;break;
			}
		}
		printf("%d\n",a);
	}
}

C++: #include<iostream>

using namespace std;

int main(){
while(1){
 int H;
 cin>>H;

 if(H==0)break;

 int S[10][5];
 for(int y=0;y<H;y++)
	for(int x=0;x<5;x++)
		cin>>S[y][x];

 int sco=0;
 
 while(1){
	bool flg=false;

	for(int y=0;y<H;y++){
		int m =S[y][2];//真ん中覚える
		if(m==0)
			continue;

		if(S[y][0]==m && S[y][1]==m){//012で消える
			sco+=m*3;
			S[y][0]=S[y][1]=S[y][2]=0;
			flg==true;
			if(S[y][3]==m){
				sco+=m;
				S[y][3]=0;
				if(S[y][4]==m){
					sco+=m;
					S[y][4]=0;
				}
			}
		}
		else if(S[y][1]==m&&S[y][3]==m){//1~3
			sco+=m*3;
			S[y][1]=S[y][2]=S[y][3]=0;
			flg=true;
			if(S[y][4]==m){
				sco+=m;
				S[y][4]=0;
			}
		}
		else if(S[y][3]==m&&S[y][4]==m){//2~4
			sco+=m*3;
			S[y][2]=S[y][3]=S[y][4]=0;
			flg=true;
		}
	}
	if(!flg)break;

	for(int x=0;x<5;x++){
		for(int y=H-1;y>=0;y--){
			if(S[y][x]!=0)
				continue;
			for(int y2=y-1;y2>=0;y2--){
				if(S[y2][x]!=0){
					S[y][x]=S[y2][x];
					S[y2][x]=0;
					break;
				}
			}
		}
	}
 }
 cout<<sco<<endl;
}
return 0;
}

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

int main()
{
	bool flag;
	int sum, H, a[5][10];
	while (cin >> H, H) {
		for (int j = 0; j < 10; j++)
			for (int i = 0; i < 5; i++)
				a[i][j] = 0;

		sum = 0;
		for (int j = 0; j < H; j++) {
			for (int i = 0; i < 5; i++) {
				cin >> a[i][j];
				sum += a[i][j];
			}
		}

		do {
			flag = false;
			for (int j = H - 1; j >= 0; j--) {
				for (int i = 0; i < 3; i++) {
					if (a[i][j] != 0 && a[i][j] == a[i + 1][j] && a[i][j] == a[i + 2][j]) {
						if (i <= 1 && a[i][j] == a[i + 3][j]) {
							if (i == 0 && a[i][j] == a[i + 4][j]) {
								a[i + 4][j] = 0;
							}
							a[i + 3][j] = 0;
						}
						a[i][j] = a[i + 1][j] = a[i + 2][j] = 0;
						flag = true;
					}
				}
			}
			for (int i = 0; i < 5; i++) {
				for (int j = 0; j < 9; j++) {
					if (a[i][j + 1] == 0 && a[i][j] != 0) {
						a[i][j + 1] = a[i][j];
						a[i][j] = 0;
						j = -1;
					}
				}
			}
		} while (flag);

		for (int j = 0; j < 10; j++)
			for (int i = 0; i < 5; i++)
				sum -= a[i][j];
		cout << sum << endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using Line = vector<char>;
using Puzzle = vector<Line>;

void newline() {cout << endl;}
template <typename T>
void put(T input){cout << input;}
template <typename T>
void putl(T input){put(input); newline();}

int n;
int point;
Puzzle puzzle;

void swap_rec(int column, int row){
  if(0<column){
    swap(puzzle[column][row], puzzle[column-1][row]);
    swap_rec(column-1, row);
  }
}

void drop(){
  Puzzle prev_puzzle = puzzle;
  for(int column=puzzle.size()-1; 0<=column; column--){
    for(int row=puzzle[column].size()-1; 0<=row; row--){
      if(puzzle[column][row] == '#')
        swap_rec(column, row);
    }
  }
  if(puzzle != prev_puzzle) drop();
}

int clear(Line &line, int n, char c){
  if(line[n] == c){
    line[n]='#';
    if(1 <= n && n < line.size()-1){
      return int(c)-int('0')+clear(line, n+1, c)+clear(line, n-1, c);
    }else{
      return int(c)-int('0');
    }
  } else {
    return 0; 
  }
}


int solve(){
  Puzzle prev_puzzle = puzzle;
  for(Line &line: puzzle)
    for(int k=1; k<line.size()-1; k++)
      if(line[k] != '#' && line[k-1] == line[k] && line[k] == line[k+1])
        point+=clear(line, k, line[k]);
  drop();
  if(prev_puzzle != puzzle) solve();
  return point;
}

int main() {
  while(cin>>n && n){
    point=0; puzzle={}; puzzle.reserve(n);
    for(int ic=0; ic<n; ic++){
      Line line; 
      line.resize(5);
      for(int lc=0; lc<5; lc++){
        char s; cin >> s; line[lc]=s;
      }
      puzzle.push_back(line);
    }
    putl(solve());
  }
}