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++: // chain_disappears_puzzle.cpp
// 2017/11/03


#include "stdafx.h"
#include <iostream>

using namespace std;

//?¶???????????????°???????????????????????¢??° stone_erase
int stone_erase(int i, int *target) {
	if (i == 0) {
		if (target[i + 2] == target[i + 3] && target[i + 3] == target[i + 4]) { //1????????????5?????????????????????
			return 5; //?¶?????????????5?????§??????
		}
	}
	if (i == 0 || i == 1) {
		if (target[i + 2] == target[i + 3]) {
			return 4; //?¶?????????????4?????§??????
		}
	}
	return 3; //?????????????????£?????????????????´???????¶?????????????3?????§??????
}

int main()
{

	//??\???????????????H?????????
	int H; //??????
	cin >> H;

	int board[10][5]; //?????¢
	int point = 0;
	int erase_address[10][3]; //?¶??????´?????¨?¶???????????????°????¨???¶
	bool erase_flag = false;

	while (H != 0) { //H???0?????\??????????????´????????????

		//??\??????????????¢board?????\??????erase_address???????????????2????????\???)
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> board[i][j];
				if (j < 3) {
					erase_address[i][j] = 0;
				}
			}
		}
		
		//?????¢???????¶?????????¨?????§????????????????´¢????????¢??¢?´¢???
		do {
			erase_flag = false; //2???????????¢?´¢??§?????????
			for (int i = 0; i < H; i++) {
				for (int j = 0; j < 3; j++) {
					if (board[i][j] == -1) continue;
					if (board[i][j] == board[i][j + 1] && board[i][j + 1] == board[i][j + 2]) { //???????????????????¶???????3???????????§????????´???
						erase_flag = true;
						erase_address[i][j] = stone_erase(j, board[i]); //erase_address????¶???????????????°???????´????ex:3????¶??????????erase_address[i][j] = 3???
						point += (board[i][j] * erase_address[i][j]);
						break; //?¬???????????§????
					}
				}
			}
			
			//??????????????????
			for (int i = 0; i < H; i++) {
				for (int j = 0; j < 3; j++) {
					if (erase_address[i][j] != 0) {
						for (int k = i; k > 0; k--) {
							for (int l = j; l < j + erase_address[i][j]; l++) {
								board[k][l] = board[k - 1][l]; // 1?????????????????????????????£????????????????????????
							}
						}
						for (int k = j; k < j + erase_address[i][j]; k++) {
							board[0][k] = -1;
						}
					}
				}
			}

			/*
			for (int i = 0; i < H; i++) {
				for (int j = 0; j < 5; j++) {
					if (board[i][j] == -1) cout << board[i][j] << " ";
					else cout << board[i][j] << "  ";
				}
				cout << endl;
			}
			cout << endl;
			*/

			//erase_address???????????????
			for (int i = 0; i < 10; i++) { 
				for (int j = 0; j < 3; j++) {
					erase_address[i][j] = 0;
				}
			}

		} while (erase_flag != false); //erase_flag???false??????????????´???????¶??????????????????????????????´???????????¢?´¢???????????????do-while?????????????????????

		cout << point << endl; //??????????????????
		point = 0; //?????????????????????

		cin >> H; // ?¬?????????¢??????????????\???
	}
    return 0;
}

C++: #include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)

using namespace std;

int h,arr[10][5];
bool erase[10][5];

void compute(){
  bool update = true;
  int score = 0;
  while( update ){
    memset(erase,false,sizeof(erase));
    update = false;
    for(int y=h-1;y>=0;y--){
      for(int x=0;x<3;x++){
        if( arr[y][x] == 0 ) continue;
        int cnt = 1;
        REP(x2,x+1,5) {
          if( arr[y][x] != arr[y][x2] ) break;
          ++cnt;
        }
        if( cnt >= 3 ) {
          update = true;
          REP(x2,x,5) {
            if( arr[y][x] != arr[y][x2] ) break;
            erase[y][x2] = true;
          } 
        }
      }
    }
    rep(y,h) rep(x,5) if( erase[y][x] ) { score += arr[y][x]; arr[y][x] = 0; }
    for(int y=h-1;y>=0;y--){
      for(int x=0;x<5;x++){
        if( arr[y][x] == 0 ) {
          int ny = y;
          while( 1 ){
            ny -= 1;
            if( ny < 0 ) break;
            if( arr[ny][x] ) { swap(arr[y][x],arr[ny][x]); break; }
          }
        }
      }
    }
  } 
  cout << score << endl;
}

int main(){
  while( cin >> h, h ){
    rep(i,h) rep(j,5) cin >> arr[i][j];
    compute();
  }
  return 0;
}

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

typedef vector<vector<int>> MAP;
int H;

int erase(MAP &field) {
  int point = 0;
  for (int y = 0; y < H; ++y) {
    int l = 2, r = 2;
    int color = field[y][2];
    while (l > 0 and field[y][l-1] == color) l--;
    while (r < 4 and field[y][r+1] == color) r++;
    if (r - l >= 2)
      for (int x = l; x <= r; ++x)
        point += field[y][x], field[y][x] = 0;
  }
  return point;
}

void drop(MAP &field) {
  for (int x = 0; x < 5; ++x) {
    vector<int> v;
    for (int y = H - 1; y >= 0; --y) {
      if (field[y][x] != 0) {
        v.push_back(field[y][x]);
        field[y][x] = 0;
      }
    }
    int y = H - 1;
    for (int color : v) {
      field[y][x] = color;
      --y;
    }
  }
}

int main() {
  while (cin >> H and H) {
    MAP field(H, vector<int>(5));
    for (int y = 0; y < H; ++y)
      for (int x = 0; x < 5; ++x)
        cin >> field[y][x];

    int sum = 0, point = 1;
    while (point > 0) {
      point = erase(field);
      sum += point;
      drop(field);
    }
    cout << sum << endl;
  }
}