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;

typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;  typedef pair<LL, LL> PLL;
typedef vector<int>    VI;   typedef vector<VI>   VVI;   typedef vector<VVI>   VVVI;
typedef vector<LL>     VLL;  typedef vector<VLL>  VVLL;  typedef vector<VVLL>  VVVLL;
typedef vector<double> VD;   typedef vector<VD>   VVD;   typedef vector<VVD>   VVVD;
typedef vector<string> VS;   typedef vector<VS>   VVS;   typedef vector<VVS>   VVVS;
typedef vector<bool>   VB;   typedef vector<VB>   VVB;   typedef vector<VVB>   VVVB;
typedef vector<PII>    VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL>    VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;

typedef unsigned int  UI;
typedef vector<UI>    VUI;
typedef vector<VUI>   VVUI;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back 
#define ALL(x)  (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a)   { OSS oss; oss << a; return oss.str(); };

template<typename T=int> inline void dump(vector<T> vs, bool ent=false) { rep(i, vs.size()) cout << vs[i] << (i+1==vs.size() ? '\n' : ' '); if (ent) cout << endl; }
template<typename T = int> inline void dump(vector<vector<T>> vs, bool ent = false) { rep(i, vs.size()) dump<T>(vs[i]); if (ent) cout << endl; }

const int    INF  = 0x3f3f3f3f;
const LL     INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int    DX[] = {1,  0, -1, 0};
const int    DY[] = {0, -1,  0, 1};
const double EPS  = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

const int W = 5;
int H;
VVI ts;

bool terase() {
    bool res = false;

    rep(y, H) {
        rep(x, 3) {
            if (ts[y][x] && 
                ts[y][x] == ts[y][x + 1] &&
                ts[y][x] == ts[y][x + 2]) {
                int n = ts[y][x];
                for (int x2 = x; x2 < W && ts[y][x2] == n; x2++) {
                    ts[y][x2] = 0;
                }
                res = true;
            }
        }
    }

    return res;
}

void tfall() {
    REP(y, 1, H) {
        rep(x, W) {
            if (ts[y][x] && !ts[y - 1][x]) {
                int y2 = y - 1;
                for (; y2 - 1 >= 0 && !ts[y2 - 1][x]; y2--);
                swap(ts[y][x], ts[y2][x]);
            }
        }
    }
}

int solve() {
    ts = VVI(H, VI(W));
    rep(y, H) rep(x, W) cin >> ts[H - y - 1][x];

    int before = 0;
    rep(i, H) before += accumulate(ALL(ts[i]), 0);

    while (true) {
        bool f = terase();
        tfall();
        if (!f) break;
    }
   
    int after = 0;
    rep(i, H) after += accumulate(ALL(ts[i]), 0);

    return before - after;
}

int main(void) {
    while (cin >> H, H) cout << solve() << endl;
    

    return 0;
}

C++: #include <iostream>
#include <cstring>

using namespace std;

int H,puz[10][5];

int solve(){
  int res = 0;
  bool update = true;
  while(update){
    update = false;
    for(int i = 0 ; i < H ; i++){
      bool c[5] = {false},ok = false;
      int num = puz[i][0],cnt = 1;
      c[0] = true;
      for(int j = 1 ; j < 5 ; j++){
        if(num == puz[i][j] && puz[i][j] > 0){
          cnt++;
          c[j] = true;
          if(cnt >= 3) ok = true;
        }else if(puz[i][j] > 0){
          if(ok) break;
          num = puz[i][j];
          cnt = 1;
          memset(c,false,sizeof(c));
          c[j] = true;
        }else{
          cnt = 0;
        }
      }
      if(cnt >= 3){
        res += cnt*num;
        update = true;
        for(int j = 0 ; j < 5 ; j++){
          if(c[j]) puz[i][j] = -1;
        }
      }
    }
    if(update){
      int tmp[10][5];
      memset(tmp,0,sizeof(tmp));
      for(int j = 0 ; j < 5 ; j++){
        int idx = H-1;
        for(int i = H-1 ; i >= 0 ; i--){
          if(puz[i][j] == -1) continue;
          tmp[idx--][j] = puz[i][j];
        }
      }
      for(int i = 0 ; i < H ; i++){
        for(int j = 0 ; j < 5 ; j++){
          puz[i][j] = tmp[i][j];
        }
      }
    }
  }
  return res;
}

int main(){
  while(cin >> H,H){
    for(int i = 0 ; i < H ; i++){
      for(int j = 0 ; j < 5 ; j++){
        cin >> puz[i][j];
      }
    }
    cout << solve() << endl;
  }
  return 0;
}