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>
using namespace std;

int main(){
	while(1){
		int H;
		cin>>H;

		if(H==0)
			break;

		int S[10][5];
		for(int y=0;y<H;y++)
			for(int x=0;x<5;x++)
				cin>>S[y][x];
	
		int sco=0;
	
		while(1){
			bool flg=false;
	
			for(int y=0;y<H;y++){
				int m=S[y][2];
				if(m==0)
					continue;
	
				if(S[y][0]==m&&S[y][1]==m){
					sco+=m*3;S[y][0]=S[y][1]=S[y][2]=0;flg=true;
					if(S[y][3]==m){
						sco+=m;S[y][3]=0;
						if(S[y][4]==m){
							sco+=m;S[y][4]=0;
						}
					}
				}
				else if(S[y][1]==m&&S[y][3]==m){
					sco+=m*3;S[y][1]=S[y][2]=S[y][3]=0;flg=true;
					if(S[y][4]==m){
						sco+=m;S[y][4]=0;
					}
				}
				else if(S[y][3]==m&&S[y][4]==m){
					sco+=m*3;S[y][2]=S[y][3]=S[y][4]=0;flg=true;
				}
			}
	
			if(!flg)
				break;
		
			for(int x=0;x<5;x++){
				for(int y=H-1;y>=0;y--){
					if(S[y][x]!=0)
						continue;

					for(int y2=y-1;y2>=0;y2--){
						if(S[y2][x]!=0){
							S[y][x]=S[y2][x];S[y2][x]=0;break;
						}
					}
				}
			}
		}

		cout<<sco<<endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const double inf = 1e9;
const int mod = 1e5;
const int MAX = 5005;

struct status {int y, x, len;};

int main() {
    int h;
    while (cin >> h && h) {
        int ans = 0;
        vvint field(h,vint(5));
        rep(i,h)rep(j,5) cin >> field[i][j];
        while (true) {
            bool update = false;
            vector<status> del;
            rep(i,h) {
                int index = -1;
                rep(j,3) {
                    if (field[i][j] == field[i][j+1] && field[i][j+1] == field[i][j+2]) {
                        index = j;
                        break;
                    }
                }
                if (index == -1) continue;
                int ct = 0;
                for (int j = 0; j+index < 5; j++) {
                    if (field[i][index] == field[i][index+j]) ct++;
                    else break;
                }
                del.push_back(status{i,index,ct});
                if (field[i][index] != 0) update = true;
                ans += ct*field[i][index];
            }
            if (del.empty() || !update) break;
            for (auto d: del) {
                for (int j = d.x; j < (d.x+d.len); j++) {
                    field[d.y][j] = 0;
                }
            }
            rep(j,5) {
                deque<int> q;
                rep(k,h) {
                    if (field[k][j] != 0) q.push_back(field[k][j]);
                }
                while (q.size() < h) q.push_front(0);
                int a = h-1;
                while (!q.empty()) {
                    int x = q.back(); q.pop_back();
                    field[a--][j] = x;
                }
            }
        }
        cout << ans << endl;
    }
}

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

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL << 25) // 33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void) {
  while (true) {
    int h, b[13][5];
    cin >> h;
    if (!h)
      break;
    REP(i, h) REP(j, 5) cin >> b[i][j];

    int ret = 0;
    REP(i, h) {
      REP(j, h) {
        int c = 1;
        FOR(k, 1, 5) {
          if (b[j][k] == b[j][k - 1] && b[j][k] != 0)
            c++;
          else {
            if (c >= 3) {
              ret += b[j][k - 1] * c;
              for (int l = k - 1; l >= k - c; --l)
                b[j][l] = -1;
            }
            c = 1;
          }
        }
        if (c >= 3) {
          ret += b[j][4] * c;
          for (int l = 4; l > 4 - c; --l)
            b[j][l] = -1;
        }
      }
      /*cout << "kesu:" << endl;
      REP(i, h) {
        REP(j, 5) {
          cout << b[i][j] << " ";
        }
        cout << endl;
      }*/
      REP(j, 5) {
        int c = 0;
        for (int k = h - 1; k >= 0; --k) {
          if (b[k][j] == -1) {
            c++;
          } else if (c) {
            int ii = 0;
            while (ii != c) {
              b[k + c - ii][j] = b[k][j];
              b[k][j] = 0;
              ++ii;
            }
          }
        }
      }
      /*cout << "otosu:" << endl;
      REP(i, h) {
        REP(j, 5) {
          cout << b[i][j] << " ";
        }
        cout << endl;
      }*/
    }

    cout << ret << endl;
  }

  return 0;
}