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<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
int inf = 1000000000;

int main(void) {
  int h;
  while(cin >> h){
    if( h == 0 ) break;

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

    int score = 0;
    while(true){
      for(int i=0; i<h; i++){
        vector<bool> a(5, false);
        for(int j=0; j<3; j++){
          if( b[i][j] == -1 ) continue;
          if( b[i][j] == b[i][j+1] && b[i][j+1] == b[i][j+2] ){
            a[j] = true;
            a[j+1] = true;
            a[j+2] = true;
          }
        }
        for(int j=0; j<5; j++){
          if( a[j] ){
            score += b[i][j];
            b[i][j] = -1;
          }
        }
      }

      for(int j=0; j<5; j++){
        for(int i=0; i<h; i++){
          if(b[i][j] == -1){
            for(int k=i; k>=1; k--){
              b[k][j] = b[k-1][j];
            }
            b[0][j] = -1;
          }
        }
      }
      // cerr << score << endl;
      // for(int i=0; i<h; i++){
      //   for(int j=0; j<5; j++){
      //     cerr << b[i][j] << " ";
      //   }
      //   cerr << endl;
      // }

      if( x == b ) break;
      x = b;
    }
    cout << score << endl;
  }

  return 0;
}

// EOF

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<time.h>
using namespace std;

//?????°

//???????????????
int H;
int point;
vector<int> block[5];

//?????¨??????
clock_t start,now;

int getNum(int col, int row) {
	if(row<block[col].size())
		return block[col][row];
	else
		return 1000*col+row;   //?¢?????????????????????§??????????????°???
}

void chain(int row) {
	bool canDelete; //?¶????????????????????????????

	//?¶???????(????????????????????¨??§????????????????????????)
	for (int range = 5; 2<range ; range--) {
		//?¶??????????
		for (int col = 0; col < 6 - range; col++) {
			canDelete=true;
			//??¨??¨??????????????????
			for (int i = col+1; i < col+range; i++) 
				//1?????§???????????¨????????°?¶??????????
				if(getNum(col,row)!=getNum(i,row)){
					canDelete=false;
					break;
			}
			//?¶????????????§????????°
			if (canDelete) {
				//??????????¨????????????????
				point+=getNum(col,row)*range;
				//??¨??¨?¶????
				for (int i = col; i < col + range; i++) {
					block[i].erase(block[i].begin()+row);
				}
				//???????????¢??°??????
				return;
			}
		}
	}


	//5????¶???????
	canDelete=true;
	for(int i=1;i<5;i++)
		if(getNum(0,row)!=getNum(i,row)){
			canDelete=false;
			break;
		}
	if (canDelete) {
		point+=block[0][row]*5;
		for (int i = 0; i < 5; i++)
			block[i].erase(block[i].begin()+row);
		return;
	}
	//4????¶???????
}

int main() {
	while (true) {
		//?????????
		point=0;
		for (int i = 0; i < 5; i++)
			while(block[i].size()>0)
				block[i].pop_back();
		//??\???
		cin>>H;
		if(H==0)break;
		for (int i = 0; i < H; i++) {
			int temp;//??????????????????????????°
			for (int j = 0; j < 5; j++) {
				cin>>temp;
				block[j].push_back(temp);
			}
		}
		//????????????0?????????????????????????????????
		for(int i=0;i<5;i++)reverse(block[i].begin(),block[i].end());


		//?????????????????????????????£????????????
		int tempPoint=point;
		while(true){
			for (int i = H; i >= 0; i--) {
				chain(i);

			}
			now=clock();

			if(tempPoint==point)break;
			else tempPoint=point;
		}
		cout<<point<<endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <array>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using Line = array<char, 5>;
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;
      for(int lc=0; lc<5; lc++){
        char s; cin >> s; line[lc]=s;
      }
      puzzle.push_back(line);
    }
    putl(solve());
  }
}