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 <algorithm>
# include <cassert>
# include <cctype>
# include <cstdio>
# include <cstdlib>
# include <cstring>
# include <cmath>
# include <iostream>
# include <map>
# include <queue>
# include <set>
# include <sstream>
# include <stack>
# include <string>
# include <vector>
# include <iomanip>

# define rep(i, n) for (int i = 0; i < (int)(n); i++)
# define irep(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define FOR(i, m, n) for (int i = int(m); i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int board[10][5];

int check(int score) {
  rep (i, 10) {
    if (board[i][0] == board[i][1] && board[i][1] == board[i][2] && board[i][2] == board[i][3] && board[i][3] == board[i][4]) {
      if (board[i][0] != -1) score += board[i][0] * 5;
      board[i][0] = -1;
      board[i][1] = -1;
      board[i][2] = -1;
      board[i][3] = -1;
      board[i][4] = -1;
    }
    if (board[i][0] == board[i][1] && board[i][1] == board[i][2] && board[i][2] == board[i][3]) {
      if (board[i][0] != -1) score += board[i][0] * 4;
      board[i][0] = -1;
      board[i][1] = -1;
      board[i][2] = -1;
      board[i][3] = -1;
    }
    if (board[i][1] == board[i][2] && board[i][2] == board[i][3] && board[i][3] == board[i][4]) {
      if (board[i][1] != -1) score += board[i][1] * 4;
      board[i][1] = -1;
      board[i][2] = -1;
      board[i][3] = -1;
      board[i][4] = -1;
    }
    if (board[i][0] == board[i][1] && board[i][1] == board[i][2]) {
      if (board[i][0] != -1) score += board[i][0] * 3;
      board[i][0] = -1;
      board[i][1] = -1;
      board[i][2] = -1;
    }
    if (board[i][1] == board[i][2] && board[i][2] == board[i][3]) {
      if (board[i][1] != -1) score += board[i][1] * 3;
      board[i][1] = -1;
      board[i][2] = -1;
      board[i][3] = -1;
    }
    if (board[i][2] == board[i][3] && board[i][3] == board[i][4]) {
      if (board[i][2] != -1) score += board[i][2] * 3;
      board[i][2] = -1;
      board[i][3] = -1;
      board[i][4] = -1;
    }
  }

  return score;
}

void update() {
  int board_tmp[10][5];
  rep (i, 10) {
    rep (j, 5) {
      board_tmp[i][j] = -1;
    }
  }

  rep (column, 5) {
    vector<int> nonzeros;

    for (int i = 10; i > 0; i--) {
      if (board[i][column] != -1) nonzeros.push_back(board[i][column]);
    }

    int j = 10;
    rep (k, nonzeros.size()) {
      board[j][column] = nonzeros[k];
      j--;
    }
  }
}

void solve(int n) {
  rep (i, 10) {
    rep (j, 5) {
      board[i][j] = -1;
    }
  }

  FOR (i, 10 - n, 10) {
    rep (j, 5) {
      cin >> board[i][j];
    }
  }

  int score = 0;
  rep (t, 18) {
    score = check(score); // ok
    update();
  }
  cout << score << endl;
}

int main() {
  int n;
  while (cin >> n) {
    if (n == 0) break;
    solve(n);
  }
}

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

using namespace std;

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mt;

ll h;
mt f;


int main(){
  while(cin >> h){
    if(h == 0) return 0;
    f = mt(h+1,vl(6));
    ll ans = 0;
    for(ll i = 1;i <= h;i++){
      for(ll j = 0;j < 5;j++) cin >> f[i][j];
    }
    bool flag;
    do{
      flag = false;
      for(ll i = 1;i <= h;i++){
        ll cnt = 0;
        ll prev = 0;
        for(ll j = 0;j <= 5;j++){
          if(f[i][j] == prev) cnt++;
          else{
            if(cnt >= 3 && prev != 0){
              flag = true;
              // cerr << cnt << " " << prev << " " << j << " " << i << endl;
              for(ll k = j-1,l = 0;l < cnt;l++,k--){
                ans += f[i][k];
                f[i][k] = 0;

              }
            }
            prev = f[i][j];
            cnt = 1;
          }
        }
      }
      for(ll s = 0;s <= h+5;s++){
        for(ll i = h;i > 0;i--){
          for(ll j = 0;j < 5;j++){
            if(f[i][j] == 0) swap(f[i][j],f[i-1][j]);
          }
        }
      }
      // for(ll i = 1;i <= h;i++){
      //   for(ll j = 0;j < 5;j++){
      //     cerr << f[i][j] << " ";
      //   }
      //   cerr << endl;
      // }

    }while(flag);

    cout << ans << endl;

  }
}