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 <vector>
#include <algorithm>
#include <string>

using namespace std;

int bord[11][5];
int H;
void solve(){
  int score = 0;
  int comboStart;
  int comboEnd;
  int tmp;
  bool combo ;
  while(true){
    //combo_check
    // cout << endl << "score =" << score << endl;
    // for(int height = H-1 ;height >= 0 ; height--){
    //   for(int width = 0; width < 5; width++){
    //     cout << bord[height][width] << " ";
    //   }
    //   cout << endl;
    // }
    combo = false;
    for(int height = H - 1 ;height >= 0 ; height--){
      for(int width = 2; width < 5; width++){
        if(bord[height][width-2] == bord[height][width-1] && bord[height][width-1] ==  bord[height][width] && bord[height][width] != -1 &&bord[height][width] != 0){
          combo = true;
          //combo 長さ確認
          comboStart = width - 2;
          comboEnd = width;
          while(true){//combo 長さ決定
            if(comboEnd+1 < 5 && bord[height][comboEnd] == bord[height][comboEnd+1]){
              comboEnd++;
            }else{
              break;
            }
          }

          score += bord[height][comboStart] * (comboEnd - comboStart + 1);
          for(int w = comboStart; w <= comboEnd; w++) bord[height][w] = -1;
        }
      }
    }
    if(!combo) break; //これ以上コンボが無いなら終了

    //コンボしたブロックをずらす
    for(int height = 0 ;height < H ; height++){
      for(int width = 0; width < 5; width++){
        if(bord[height][width] == -1){
          for(int h = height ; h < H; h++){
            bord[h][width] = bord[h+1][width];
          }
          height -- ;
        }
      }
    }
  }
  cout << score << endl;
}

int main(){
  while(true){
    cin >> H;
    if(H == 0)break;
    for(int height = H - 1 ;height >= 0 ; height--){
      for(int width = 0; width < 5; width++){
        cin >> bord[height][width];
      }
    }
    solve();
  }
  return 0;
}

C++: #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
template<class T> using vv=vector<vector< T > >;
typedef deque<int> di;
typedef deque<deque<int> > ddi;

// cout vector
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
    int len = v.size();
    for (int i = 0; i < len; ++i) {
        s << v[i]; if (i < len - 1) s << "\t";
    }
    return s;
}

// cout 2-dimentional vector
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
    int len = vv.size();
    for (int i = 0; i < len; ++i) {
        s << vv[i] << endl;
    }
    return s;
}

int main() {
    while (true) {
        int h;
        cin >> h;
        if ( h == 0 ) { break; }
        vvi b(5, vi(h));
        for (int i = h-1; i >= 0; --i) {
            rep (j, 5) {
                cin >> b[j][i];
            }
        }

        int point = 0;
        while (true) {
            vvi st;
            rep (i, h) {
                map<int, int> mp;
                rep (j, 5) {
                    mp[b[j][i]] += 1;
                }
                int tmpmax = -1;
                FOR (k, 1, 10) {
                    tmpmax = max(tmpmax, mp[k]);
                }
                if (tmpmax < 3) { continue; }
                if (tmpmax == 5 ) {
                    st.pb({i, 0, 5});
                    continue;
                } else if (tmpmax == 4) {
                    if (b[0][i] == b[3][i] && b[3][i] != b[4][i]) {
                        st.pb({i, 0, 4});
                        continue;
                    } else if (b[1][i] == b[4][i] && b[1][i] != b[0][i]) {
                        st.pb({i, 1, 4});
                        continue;
                    }
                }
                if (b[0][i] == b[1][i] && b[1][i] == b[2][i]) {
                    st.pb({i, 0, 3});
                } else if (b[1][i] == b[2][i] && b[2][i] == b[3][i]) {
                    st.pb({i, 1, 3});
                } else if (b[2][i] == b[3][i] && b[3][i] == b[4][i]) {
                    st.pb({i, 2, 3});
                }
            }
            if ( st.empty() ) { break; }
            for (int itr = st.size()-1; itr >= 0; --itr) {
                auto elm = st[itr];
                point += b[elm[1]][elm[0]] * elm[2];
                rep (i, elm[2]) {
                    b[elm[1]+i].erase(begin(b[elm[1]+i])+elm[0]);
                }
            }
            rep (i, 5) {
                b[i].resize(h);
            }
        }
        printf("%d\n", point);
    }
    return 0;
}