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>
#define rep(i,j) for (int (i)=0;(i)<(int)(j);++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

int H;
int solve(vector<vector<int>> board) {
    bool update = true;
    int score = 0, prev_score = 0;
    while (update) {
        update = false;

        // delete
        rep(r, H) {
            int tmp = 0, prev = -1;
            rep(c, 5) {
                if (board[r][c] == -100) continue;
                if (prev == -1) {
                    prev = board[r][c];
                    tmp++;
                }
                else {
                    if (prev == board[r][c]) {
                        tmp++;
                    }
                    else {
                        if (tmp >= 3 and prev > 0) {
                            score += prev * tmp;
                            for (int k=c-tmp; k<c; ++k) board[r][k] = -100;
                        }
                        prev = board[r][c];
                        tmp = 1;
                    }
                }
            }
            if (tmp >= 3 and prev > 0) {
                score += prev * tmp;
                for (int k = 5-tmp; k < 5; ++k) board[r][k] = -100;
            }
        }

        // fall
        for (int r = H-1; r >= 0; --r) {
            for (int c = 0; c < 5; ++c) {
                if (board[r][c] > 0) {
                    for (int rr=r+1; rr < H; ++rr) {
                        if (board[rr][c] == -100) {
                            board[rr][c] = board[rr-1][c];
                            board[rr-1][c] = -100;
                        }
                        else break;
                    }
                }
            }
        }

        if (prev_score < score) {
            update = true;
        }
        prev_score = score;

    }
    return score;
}

int main() {
    while (cin >> H, H) {
        vector<vector<int>> board(H, vector<int>(5));
        rep(r, H) rep(c, 5) cin >> board[r][c];
        cout << solve(board) << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>

using namespace std;

int H,c,ct=0,tmpct=0;
vector<int> b;
int ren=0;
void solve(){
  bool roop = true;
  while(roop){
  for(int i=0;i<H*6-2;i++){
    if(b[i] == b[i+1] && b[i+1] == b[i+2] && b[i] != 0){
      if(ren == 0){tmpct += b[i]*3;ren++;
      }else{
	tmpct += b[i];
	ren++;
      }
    }else if(ren>0){
      for(int j=i-ren;j<i+2;j++)
	b[j]=0;
      ren = 0;
    }
  }




  for(int i=0;i<5;i++){
    c=0;
    for(int j=0;j<H;j++)
	if(b[(H-j-1)*6 + i]==0)c++;
	else if(c>0){
	  b[(H-j+c-1)*6 + i] = b[(H-j-1)*6 + i];
	  b[(H-j-1)*6 + i] = 0;
    }
  }

  /*      for(int i=0;i<H;i++){
      for(int j=0;j<6;j++){
      cout << b[(i)*6 + j] << " ";
      }
      cout << "\n";
    }
      cout << "tmpct" << tmpct << "\n";
  */      
    if(tmpct > 0){ct += tmpct;
      tmpct = 0;}
    else break;


  
  }
}



int main(){
  while(true){
    cin >> H;
    if(H == 0)break;
    b.resize(H*6);
    for(int i=0;i<H;i++){
    cin >> b[i*6] >> b[i*6+1] >> b[i*6+2] >> b[i*6+3] >> b[i*6+4];
    b[i*6+5]=-1;
    }
    solve();
    b.clear();
    cout << ct << endl;
    ct = 0;
  }

  return 0;
}

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;
            }
          }
        }
        if (c) {
          REP(k, c) b[k][j] = 0;
        }
      }
      /*cout << "otosu:" << endl;
      REP(i, h) {
        REP(j, 5) {
          cout << b[i][j] << " ";
        }
        cout << endl;
      }*/
    }

    cout << ret << endl;
  }

  return 0;
}