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 int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;

const int MAX_H = 11;
int a[MAX_H][5];
int H;
int ans;

void init() {
    ans = 0;
    rep(i, H) {
        rep(j, 5) {
            cin >> a[i][j];
        }
    }
}

bool erase() {
    bool erased = false;
    rep(i, H) {
        rep(l, 5) {
            if (a[i][l] == 0) continue;
            int r = l;
            while (r < 5 && a[i][r] == a[i][l]) {
                r++;
            }
            if (r - l >= 3) {
                // erase
                rep2(j, l, r) {
                    ans += a[i][j];
                    a[i][j] = 0;
                }
                erased = true;
            }
        }
    }

    return erased;
}

void drop() {
    for (int i = H - 1; i >= 1; i--) {
        rep(j, 5) {
            if (a[i][j] == 0) {
                for (int i2 = i - 1; i2 >= 0; i2--) {
                    if (a[i2][j] != 0) {
                        a[i][j] = a[i2][j];
                        a[i2][j] = 0;
                        break;
                    }
                }
            }
        }
    }
}

bool step() {
    if (!erase()) return false;
    drop();
    return true;
}


signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    while (cin >> H, H) {
        init();
        while (step());
        cout << ans << endl;
    }
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;


using namespace std;

int MAP[10][5];
int h;
void fall(){
	rep(i,h){
		for(int i=h-1;i>0;i--) rep(j,5){
			if(MAP[i][j]==-1){
				MAP[i][j]=MAP[i-1][j];
				MAP[i-1][j]=-1;
			}
		}
	}
}

int search(int x,int y,int num,int count){

	if(x<0||y<0||x>=5) return count;
	if(MAP[y][x]==-1||MAP[y][x]!=num) return count;


	int ans = 0;
	count++;
	count = search(x+1,y,num,count);

	if(count>=3) MAP[y][x]=-1;

	return count;
}

int main(){

	while(1){
		cin >> h;

		if(h==0) break;

		int ans=0;
		int p_score=-1;
		memset(MAP,-1,sizeof(MAP));
		rep(i,h) rep(j,5) cin >> MAP[i][j];


		while(1){
			rep(i,h) rep(j,5){
				int point = MAP[i][j];  
				int combo = search(j,i,MAP[i][j],0);
				if(combo>=3){
					ans+=combo*point;
				}
			}

			fall();

			if(p_score==ans) break;
			p_score=ans;
		}
		cout << ans << endl;
	}

}

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

using namespace std;

int main(){

  int h;
  cin >> h;

  while(h!=0){
    int a[h][5];
    for(int i=0;i<h;i++){
      for(int j=0;j<5;j++)cin >> a[i][j];
    }

    int score=0;

    int c=1;
    while(c!=0){
      c=0;
      //b・・・各列に対しての落差
      int b[5]={};
      for(int i=0;i<h;i++){
        //その行はすべて消える
        if(a[i][0]==a[i][1] && a[i][1]==a[i][2] && a[i][2]==a[i][3] && a[i][3]==a[i][4] && a[i][0]!=0){
          c+=5*a[i][1];
          for(int j=0;j<5;j++){
            b[i]++;
            a[i][j]=0;
          }
        }
        //左から4つ消える
        else if(a[i][0]==a[i][1] && a[i][1]==a[i][2] && a[i][2]==a[i][3] && a[i][0]!=0){
          c+=4*a[i][1];
          for(int j=0;j<4;j++){
            b[j]++;
            a[i][j]=0;
          }
        }
        //右から4つ消える
        else if(a[i][3]==a[i][4] && a[i][1]==a[i][2] && a[i][2]==a[i][3] && a[i][1]!=0){
          c+=4*a[i][1];
          for(int j=1;j<5;j++){
            b[j]++;
            a[i][j]=0;
          }
        }
        //左から3つ消える
        else if(a[i][0]==a[i][1] && a[i][1]==a[i][2] && a[i][2]!=0){
          c+=3*a[i][2];
          for(int j=0;j<3;j++){
            b[j]++;
            a[i][j]=0;
          }
        }
        //真ん中の3つ消える
        else if(a[i][3]==a[i][2] && a[i][1]==a[i][2] && a[i][2]!=0){
          c+=3*a[i][2];
          for(int j=1;j<4;j++){
            b[j]++;
            a[i][j]=0;
          }
        }
        //右から3つ消える
        else if(a[i][4]==a[i][3] && a[i][3]==a[i][2] && a[i][2]!=0){
          c+=3*a[i][2];
          for(int j=2;j<5;j++){
            b[j]++;
            a[i][j]=0;
          }
        }
      }

      score += c;
      for(int i=0;i<5;i++){
        int z=0;
        for(int j=h-1;j>=0;j--){
          if(a[j][i]==0)z++;
          else if(z!=0){
            a[j+z][i]=a[j][i];
            a[j][i]=0;
          }
        }
      }

    }

    cout << score << endl;

    cin >> h;
  }


}