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 <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());
  }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

/** Problem1193 : Chain Disappearance Puzzle **/

int main()
{
	int H;
	while (cin>>H, H) {
		vector<vector<int> > board(H, vector<int>(5));
		int ans=0;
		
		for (int y=0; y<H; y++) {
			for (int x=0; x<5; x++) {
				cin>>board[y][x];
			}
		}
		
		
		while (true) {
			bool update=false;

			// erase
			for (int y=0; y<H; y++) {
				for (int x=0; x<5; x++) {
					int count = 1;
					if (board[y][x]<0) continue;
					
					for (int tx=x+1; tx<5; tx++) {
						if (board[y][tx] == board[y][tx-1])	
							count++;
						else
							break;
					}
					
					if (count>=3) {
						update = true;
						ans += count*board[y][x];
						for (int i=0; i<count; i++) {
							board[y][x+i] = -1;
						}
					}
				}
			}
		
			// drop
			for (int x=0; x<5; x++) {
				for (int y=H-2; y>=0; y--) {
					if (board[y][x]>=0) {
						int ty=y;
						while (ty+1<H && board[ty+1][x]<0 && board[ty][x]>=0) {
							swap(board[ty+1][x], board[ty][x]);
							ty++;
						}
					}
				}
			}
			
			if (!update) break;
		}
		
		cout << ans << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
void pfield(vector<vector<int> >, int);

int main() {
  int cols;
  while(cin >> cols, cols) {
    vector<vector<int> > field(5); // [col][line]
    for(int il = 0; il < cols; ++il) {
      for(int ic = 0; ic < 5; ++ic) {
        int num;
        cin >> num;
        field[ic].push_back(num);
      }
    }
    for(int ic = 0; ic < 5; ++ic) {
      reverse(field[ic].begin(), field[ic].end());
    }
    int score = 0;
    int lastScore = 0;
    do {
      lastScore = score;
      // Top down scan
      for(int il = cols - 1; il >= 0; --il) {
        int rowCnt = 0;
        int lastNum = -1;
        for(int ic = 0; ic < 5; ++ic) {
          if(field[ic].size() <= il) {
            rowCnt = 0;
            continue;
          }
          (field[ic][il] == lastNum) ? ++rowCnt : (rowCnt = 0);
          int eraseNum = lastNum;
          lastNum = field[ic][il];
          if(rowCnt == 2) {
            for(int dic = -2; dic <= 0; ++dic) {
              field[ic + dic].erase(field[ic + dic].begin() + il);
              score += eraseNum;
            }
          } else if(rowCnt > 2) {
            field[ic].erase(field[ic].begin() + il);
            score += eraseNum;
          }
        }
      }
    } while(score != lastScore);
    cout << score << endl;
  }
  return 0;
}

void pfield(vector<vector<int> > field, int cols) {
  for(int il = cols - 1; il >= 0; --il) {
    for(int ic = 0; ic < 5; ++ic) if(field[ic].size() > il) cout << field[ic][il];
    cout << endl;
  }
  cout << endl;
}