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>
using namespace std;

int main(){
    int h;
    while(cin >> h, h){
        int d[11][6] = {0};
        for(int i = 0; i < h; i++){
            for(int j = 0; j < 5; j++){
                cin >> d[i][j];
            }
        }
        int score = 0;
        bool f = true;
        while(f){
            f = false;
            for(int i = 0; i < h; i++){
                for(int j = 0; j < 5; j++){
                    if(d[i][j] <= 0) continue;
                    int now = d[i][j];
                    int count = 1;
                    for(int k = j + 1; k < 5; k++){
                        if(d[i][k] == now) count++;
                        else break;
                    }
                    if(count >= 3){
                        f = true;
                        score += now * count;
                        for(int k = j; k < j + count; k++) d[i][k] = -1;
                        break;
                    }
                }
            }
            for(int i = 0; i < 5; i++){
                for(int j = h - 1; j > 0; j--){
                    if(d[j][i] != -1) continue;
                    for(int k = j - 1; k >= 0; k--){
                        if(d[k][i] > 0){
                            swap(d[j][i], d[k][i]);
                            break;
                        }
                    }
                }
            }
        }
        cout << score << endl;
    }
}

C++: #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

#define EPS 1e-10
#define INF 1000000000
#define mp make_pair
#define pb push_back

typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pii;
typedef long long ll;

void dropStones(vii &board) {
  for (int w = 0; w < 5; w++) {
    queue<int> que;
    for (int h = board.size() - 1; h > 0; h--){
      if (board[h][w] != 0) {
        que.push(board[h][w]);
        board[h][w] = 0;
      }
    }
    for (int h = board.size() - 1; h > 0; h--){
      if (que.empty()) {
        break;
      }
      board[h][w] = que.front();
      que.pop();
    }
  }
}

int calcPoints(vii &board) {
  int rep = 0;
  for (int h = 1; h < board.size(); h++) {
    int cnt = 1, p = board[h][2];
    vi tmp = board[h];
    tmp[2] = 0;
    if (p == 0) {
      continue;
    }
    for (int w = 3; w < board[0].size(); w++) {
      if (board[h][w] == p) {
        cnt++;
        tmp[w] = 0;
      } else {
        break;
      }
    }
    for (int w = 1; w >= 0; w--) {
      if (board[h][w] == p) {
        cnt++;
        tmp[w] = 0;
      } else {
        break;
      }
    }

    if (cnt >= 3) {
      rep += cnt * p;
      board[h] = tmp;
    }
  }
  if (rep == 0) {
    return 0;
  }
  dropStones(board);
  return rep + calcPoints(board);
}

int main() {
  int H;
  while (1) {
    cin >> H;
    if (H == 0) {
      break;
    }
    vii board(H + 1, vi(5, 0));
    for (int h = 1; h <= H; h++) {
      for (int w = 0; w < 5; w++) {
        cin >> board[h][w];
      }
    }
    cout << calcPoints(board) << endl;
  }
}