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 <bits/stdc++.h>
 
using namespace std;
 
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
 
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
 
typedef long long ll;
typedef pair<int, int> PII;
 
const double EPS = 1e-10;
 
const int H = 10;
const int W = 5;
int h;
int c[H][W];
 
int main() {
  int i, j, k, l;
  int res;
 
  while (1) {
    scanf("%d ", &h); 
    if (!h) break;
 
    for (i=0; i<h; i++)
      for (j=0; j<W; j++)
        scanf("%d ", &(c[i][j]));
 
    res = 0;
    bool update = true;
    while (update) {
      update = false;
      for (i=h-1; i>=0; i--) {
        for (j=0; j<3; j++) {
          k = 1;
          while (c[i][j]!=0 && j+k<W && c[i][j+k]==c[i][j]) k++;
          if (k >= 3) {
            res += k * c[i][j];
            for (l=j; l<j+k; l++) c[i][l] = 0;
            update = true;
            break;
          }
        }
      }
 
      for (i=h-2; i>=0; i--)
        for (j=0; j<W; j++) {
          int d = i;
          while (d+1<h && c[d+1][j]==0) d++;
          if (i!=d) {
            c[d][j] = c[i][j];
            c[i][j] = 0;
          }
        }
    }
 
    printf("%d\n", res);
  }
 
  return 0;
}

C++: #include<iostream>

using namespace std;

int H,t[50][6];

int main(){
    while(1){
        cin>>H;
        if(H==0)break;

        for(int i=H-1;i>=0;i--){
            for(int j=0;j<5;j++){
                cin>>t[i][j];
            }
        }

        int ans=0;

        while(1){
            int tmp=ans;

            for(int i=0;i<H;i++){
	            int key=t[i][0],cnt=1;
	            t[i][5]=-1;

	            for(int j=1;j<6;j++){
	                if(key==t[i][j])cnt++;
	                else{
	                    if(cnt>=3&&key!=0)

	                    for(int k=0;k<cnt;k++){
		                ans+=key;
		                t[i][j-k-1]=0;
	                    }

	                    cnt=1;
	                    key=t[i][j];
	                }
	            }
            }

            if(tmp==ans)break;

            for(int j=0;j<5;j++){
	            int I=0;

	            for(int i=0;i<H;i++){
	                if(t[i][j]==0)continue;
	                t[I][j]=t[i][j];
	                I++;
	            }

	            while(I<H)t[I++][j]=0;
            }
        }
    
        cout<<ans<<endl;
    }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
using namespace std;

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

int h, point;
int f[11][6];

bool check() {
	bool res = false;
	for(int y=h-1; y>=0; y--) {
		for(int x=2; x<5; x++) {
			if(f[y][x]!=0 && f[y][x-2]==f[y][x] && f[y][x-1]==f[y][x]) {
				res = true;
				int dx=1;
				while(x+dx<5 && f[y][x]==f[y][x+dx]) dx++;
				point += f[y][x] * (3+dx-1);
				for(int ex=x-2; ex<x+dx; ex++) {
					f[y][ex] = 0;
				}
			}
		}
	}
	return res;
}

void fall() {
	int py[5] = {};
	rep(y, h) {
		rep(x, 5) {
			f[py[x]][x] = f[y][x];
			if(f[y][x]>0) {
				py[x]++;
			}
		}
	}
	rep(x, 5) {
		for(int y=py[x]; y<h; y++) {
			f[y][x] = 0;
		}
	}
}

int main() {
	while(cin >> h, h) {
		point = 0;
		memset( f, 0, sizeof(f) );
		rep(y, h) {
			rep(x, 5) {
				int k;
				cin >> k;
				f[h-y-1][x] = k;
			}
		}
		while(check()) {
			fall();
		}
		cout << point << 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;
}