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 <algorithm>
#include <vector>
using namespace std;

int main() {
  while(true) {
    int N; cin >> N;
    if(N == 0) break;
    vector<vector<int>> G(N, vector<int>(5));
    for(int i = 0; i < N; ++i) {
      for(int j = 0; j < 5; ++j)
        cin >> G[i][j];
    }
    int point = 0;
    while(true) {
      bool update = false;
      // ブロックを消す
      for(int i = 0; i < N; ++i) {
        for(int j = 0; j < 5; ++j) {
          if(G[i][j] == 0) continue;
          int s = 0;
          for(int k = j; k < 5; ++k) {
            if(G[i][k] == G[i][j]) ++s;
            else break;
          }
          if(s >= 3) {
            update = true;
            for(int k = j; k < j + s; ++k) {
              point += G[i][k];
              G[i][k] = 0;
            }
          }
        }
      }
      if(!update) break;
      // ブロックを落とす
      for(int i = N - 1; i >= 0; --i) {
        for(int j = 0; j < 5; ++j) {
          if(G[i][j] == 0) {
            int t = -1;
            for(int k = i - 1; k >= 0; --k) {
              if(G[k][j] != 0) {
                t = k;
                break;
              }
            }
            if(t != -1) {
              G[i][j] = G[t][j];
              G[t][j] = 0;
            }
          }
        }
      }
#if 0
      for(int i = 0; i < N; ++i) {
        for(int j = 0; j < 5; ++j) {
          cerr << G[i][j];
        }
        cerr << endl;
      }
#endif
    }
    cout << point << endl;
  }
}

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

using namespace std;

#ifdef DEBUG_MODE
	#define DBG(n) n;
#else
	#define DBG(n) ;
#endif
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define MOD 1000000007

typedef long long ll;
typedef pair<ll,ll> P;

int main(){
	int n;
	
	while(cin >> n,n){
		int mp[11][11];
		
		REP(i,n)REP(j,5)cin >> mp[i][j];
		int ans = 0;
		while(1){
			bool flag = false;
			REP(i,n){
				REP(j,5){
					int cou = 0;
					int now = 0;
					for(int k = j;k < 5;k++){
						if(mp[i][k] == -1)break;
						if(k == j){
							now = mp[i][k];
							cou = 1;
						}
						else{
							if(mp[i][k] == now)cou++;
							else break;
						}
					}
					if(cou >= 3){
						flag = true;
						for(int k = 0;k < cou;k++){
							ans += mp[i][j+k];
							mp[i][j+k] = -1;
						}
					}
				}
			}
			
			REP(q,n){
				for(int i = n-1;i > 0;i--){
					REP(j,5){
						if(mp[i][j] == -1){
							mp[i][j] = mp[i-1][j];
							mp[i-1][j] = -1;
						}
					}
				}
			}			
			if(!flag)break;
		}
		cout << ans << endl;
	}
	
	return 0;
}

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

int M[11][5];

int main() {
	ios::sync_with_stdio(false);
	while(true) {
		int H; cin >> H;
		if(H == 0) break;
		memset(M, 0, sizeof(M));
		for(int i = H - 1; i >= 0; --i) {
			for(int j = 0; j < 5; ++j) {
				cin >> M[i][j];
			}
		}
		int ans = 0;
		while(true) {
			/*
			for(int i = H - 1; i >= 0; --i) {
				for(int j = 0; j < 5; ++j) printf("%d", M[i][j]);
				printf("\n");
			}
			*/
			bool update = false;
			for(int i = 0; i < H; ++i) {
				for(int j = 0; j < 5; ++j) {
					if(M[i][j] == 0) continue;
					int s = 0;
					for(int k = j; k < 5; ++k) {
						if(M[i][k] == M[i][j]) ++s;
						else break;
					}
					if(s >= 3) {
						ans += s * M[i][j];
						for(int x = 0; x < s; ++x) {
							M[i][j + x] = 0;
						}
						update = true;
					}
				}
			}
			for(int j = 0; j < 5; ++j) {
				while(true) {
					bool update2 = false;
					for(int i = 0; i < H; ++i) {
						if(M[i][j] == 0 && M[i + 1][j] != 0) {
							M[i][j] = M[i + 1][j];
							M[i + 1][j] = 0;
							update2 = true;
						}
					}
					if(!update2) break;
				}
			}
			if(!update) break;
		}
		cout << ans << endl;
	}
}