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>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
const int INF=1145141919,MOD=1e9+7;
const int64_t LINF=8931145141919364364,LMOD=998244353;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[]={1,0,-1,0,1,1,-1,-1};

int main() {
	int h;
	while(cin >> h and h > 0) {
		int b[h][6] = {};
		for(int i = 0; i < h; ++i) {
			for(int j = 0; j < 5; ++j) {
				cin >> b[i][j];
			}
		}
		int ans = 0;
		while(true) {
			bool flg = false;
			for(int y = 0; y < h; ++y) {
				int pre = -1;
				int cnt = 0;
				for(int x = 0; x <= 5; ++x) {
					if(b[y][x] != pre) {
						if(pre > 0 and cnt >= 3) {
							flg = true;
							for(int k = 1; k <= cnt; ++k) {
								ans += b[y][x - k];
								b[y][x - k] = 0;
							}
						}
						pre = b[y][x];
						cnt = 1;
					} else {
						++cnt;
					}
				}
			}
			if(not flg) break;
			for(int x = 0; x < 5; ++x) {
				for(int y = h - 2; y >= 0; --y) {
					for(int i = y; i + 1 < h; ++i) {
						if(b[i + 1][x] == 0) swap(b[i][x], b[i + 1][x]);
					}
				}
			}
		}
		cout << ans << '\n';
	}
	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, s, n) for (signed i = (s); i < signed(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

const double EPS = 1e-9;

signed main() {
	int h;
	while (cin >> h && h) {
		VV board(h, V(5));
		rep(i, h) rep(j, 5) cin >> board[i][j];
		int score = 0;

		while (true) {
			int added = 0;
			VV next = board;
			rep(i, h) rep(j, 3) {
				if (board[i][j] == board[i][j + 1] && board[i][j] == board[i][j + 2]) {
					added += next[i][j] + next[i][j + 1] + next[i][j + 2];
					next[i][j] = next[i][j + 1] = next[i][j + 2] = 0;
				}
			}
			score += added;
			board = move(next);
			rep(j, 5) {
				int shift = 0;
				for (int i = h - 1; i >= 0; i--) {
					board[i + shift][j] = board[i][j];
					shift += board[i][j] == 0;
				}
			}
			if (added == 0) break;
		}

		cout << score << endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int h,ans;
  int map[10][7];
  bool b;
  while(1){
    cin>>h;
  if(h==0) break;
  b=true;
  ans=0;
  for(int i=0;i<10;i++){
    for(int j=0;j<7;j++){
      map[i][j]=0;
    }
  }
  for(int i=0;i<h;i++){
    for(int j=0;j<5;j++){
      cin>>map[i][j];
    }
  }
  while(b){
    /*cout<<endl;*/
    b=false;
  for(int i=0;i<h;i++){
    for(int j=0;j<3;j++){
      if(map[i][j]==0) continue;
      if(map[i][j]==map[i][j+1] && map[i][j]==map[i][j+2]){
	b=true;
	if(map[i][j]==map[i][j+3]){
	  if(map[i][j]==map[i][j+4]){
	    for(int k=j;k<j+5;k++){
	       ans+=map[i][k];
	       map[i][k]=0;
	    }
	  }
	  else for(int k=j;k<j+4;k++){
	      ans+=map[i][k];
	      map[i][k]=0;
	    }
	}
	else for(int k=j;k<j+3;k++){
	    ans+=map[i][k];
	      map[i][k]=0;
	  }
      }
    }
  }
  for(int i=0;i<h;i++){
    for(int j=0;j<5;j++){
      if(map[i][j]==0){
	for(int k=i;k>=0;k--){
	  if(k==0) map[k][j]=0;
	  else map[k][j]=map[k-1][j];
	}
      }
    }
  }
  /*for(int i=0;i<h;i++){
    for(int j=0;j<5;j++){
      cout<<map[i][j]<<" ";
    }
    cout<<endl;
    }
    cout<<ans<<endl;*/
  }
  cout<<ans<<endl;
  }
  return 0;
}

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

#define REP(i, n) for(int i = 0; i < (int) (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 1e9

using namespace std;

int stones[15][5];
int n, score;

void del(){
  REP(i, n){
    int tmp = 0; int count = 0;
    REP(j, 5){
      if(stones[i][j] == tmp) {
        count++;
        if(j == 4 and count >= 3 and tmp > 0) { REP(k, count) stones[i][j-k] = 0; score+= tmp * count; }
      }
      else{
        if(count >= 3 and tmp > 0) { REP(k, count) stones[i][j-1-k] = 0; score += tmp * count; }
        count = 1;
      }
      tmp = stones[i][j];
    }
  }
  REP(k, n) REP(j, 5) REP(i, n){
    if(stones[n-1-i][j] == 0 and n-2-i >= 0) swap(stones[n-1-i][j], stones[n-2-i][j]);
  }
}

int main(){
  while(cin >> n and n){
    memset(stones, -1, sizeof(stones));
    score = 0;
    REP(i, n) REP(j, 5) cin >> stones[i][j];
    REP(k, n) del();
    cout << score << endl;
  }
  return 0;
}