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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}

signed main() {
    int H;
    while (cin >> H) {
	if (H == 0) break;
	
	int b[10][5];
	rep(i, H) {
	    rep(j, 5) {
		cin >> b[i][j];
	    }
	}

	int ret = 0;
	bool change = true;
	while (change) {
	    change = false;
	    rep(y, H) {
		int pt = 0;
		REP(x, 1, 4) {
		    if (b[y][x] == b[y][pt]) continue;
		    if (x - pt >= 3 && b[y][pt] != 0) {
			change = true;
			REP(ax, pt, x - 1) {
			    ret += b[y][ax];
			    b[y][ax] = 0;
			}
		    }
		    pt = x;
		}
		if (5 - pt >= 3 && b[y][pt] != 0) {
		    change = true;
		    REP(ax, pt, 4) {
			ret += b[y][ax];
			b[y][ax] = 0;
		    }
		}
	    }
	    queue<int> q[5];
	    rep(x, 5) {
		for (int y = H - 1; y >= 0; y--) {
		    if (b[y][x] != 0) q[x].push(b[y][x]);
		}
		while (q[x].size() < H) q[x].push(0);
	    }
	    rep(x, 5) {
		for (int y = H - 1; y >= 0; y--) {
		    b[y][x] = q[x].front();
		    q[x].pop();
		}
	    }
	}
	cout << ret << endl;
    }

    return 0;
}

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

using namespace std;

int erase(int H, vector<vector<int>> &p)
{
    int point = 0;
    for (int i = 0; i < H; i++) {        
        for (int j = 0; j < 5; j++) {
            int num = p[i][j], nj = j;
            if (num == -1) continue;
            for (int k = j + 1; k < 5; k++) {
                if (num != p[i][k]) {
                    break;
                }
                nj = k;
            }
            if (nj - j + 1 >= 3) {
                for (int k = j; k <= nj; k++) {
                    p[i][k] = -1;
                }
                point += num * (nj - j + 1);
            }
        }
    }
    return point;
}

void drop(int H, vector<vector<int>> &p)
{
    for (int i = H-1; i > 0; i--) {
        for (int j = 0; j < 5; j++) {
            if (p[i][j] == -1) {
                int k = i;            
                while (k > 0 && p[k][j] == -1) {
                    k--;
                }
                swap(p[i][j], p[k][j]);
            }
        }
    }
}

int get_point(int H, vector<vector<int>> &p)
{
    int point = 0;
    while (1) {
        int npoint = point + erase(H, p);
        if (point == npoint) break;
        drop(H, p);
        point = npoint;
    }
    return point;
}

int main()
{
    int H;
    while (cin >> H, H) {
        vector<vector<int>> p(H, vector<int>(5));
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < 5; j++) {
                cin >> p[i][j];
            }
        }
        cout << get_point(H, p) << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <cmath>
using namespace std;

int H, score;
int board[10][5];

bool checkBoard(){
 bool flag = false;
 for(int i = 0; i < H; i++){
  int prev = board[i][0], head = 0, tail = 1;
  for(int j = 1; j < 5; j++){
   if(board[i][j] == prev && prev != 0) tail++;
   else{
    if(tail - head >= 3) continue;
    head = j;
    tail = head + 1;
    prev = board[i][j];
   }
  }

  if(tail - head < 3) continue;
  score += board[i][head] * (tail - head);
  flag = true;
  
  for(int j = i; j >= 1; j--){
   for(int s = head; s < tail; s++) board[j][s] = board[j-1][s];
  }

  for(int j = head; j < tail; j++) board[0][j] = 0;
 }

 return flag;
}

int main(void)
{
 while(cin >> H && H != 0){
  score = 0;
  for(int i = 0; i < H; i++){
   for(int j = 0; j < 5; j++) cin >> board[i][j];
  }
  while(checkBoard());
  cout << score << endl;
 }
 return 0;
}