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<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define pb push_back

const int H = 11;
const int W = 5;

int h;
int board[H][W];

bool input(){
	cin>>h;
	if(h==0)return false;
	
	rep(i,H)rep(j,W)board[i][j]=0;
	rep(i,h){
		rep(j,W)cin>>board[i][j];
	}
	
	return true;
}

int check[H][W];

void docheck(){
	rep(i,H)rep(j,W)check[i][j]=0;
	
	rep(i,h){
		rep(j,W-2){
			bool hit = true;
			rep(k,3){
				if(board[i][j+k] != board[i][j])hit=false;
			}
			if(hit){
				rep(k,3)check[i][j+k]=1;
			}
		}
	}
}

int del(){
	int ans= 0;
	rep(i,h){
		rep(j,W){
			if(check[i][j]==1){
				ans += board[i][j];
				board[i][j]=0;
			}
		}
	}
	return ans;
}

void tsume(){
	rep(i,h){
		reps(j,1,h){
			rep(k,W){
				if(board[j][k]==0){
					swap(board[j-1][k], board[j][k]);
				}
			}
		}
	}
}

void print(){
	rep(i,h){
		rep(j,W)printf("%d ",board[i][j]);puts("");
	}
}

void solve(){
	int ans = 0;
	while(1){
		
		docheck();
		
		int val = del();
		ans += val;
		if(val==0)break;
		
		tsume();
		
		//print();puts("");
	}
	cout<<ans<<endl;
}

int main(){
	while(input())solve();
}

C++: #include <bits/stdc++.h>
#define ALL(a)  (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;

int main(){
vll result(0);
while(true){
  int H;
  cin >> H;
  if(H == 0) break;

  vvi a(H, vi(5, 0));
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5; j++){
      cin >> a.at(i).at(j);
    }
  }
  bool repflag;
  ll res = 0;
  do{
    vector<vector<bool>> flag(H, vector<bool>(5, false));
    repflag = false;

    for(int i = 0; i < H; i++){
      for(int j = 0; j <= 2; j++){
        if(a.at(i).at(j) != 0 && a.at(i).at(j) == a.at(i).at(j+1) && a.at(i).at(j) == a.at(i).at(j+2)){
          repflag = true;
          flag.at(i).at(j) = true; flag.at(i).at(j+1) = true; flag.at(i).at(j+2) = true;
        }
      }
    }

    for(int i = 0; i < H; i++){
      for(int j = 0; j < 5; j++){
        if(flag.at(i).at(j)){
          res += a.at(i).at(j);
          a.at(i).at(j) = 0;
        }
      }
    }

    for(int i = H-1; i >= 1; i--){
      for(int j = 0; j < 5; j++){
        if(a.at(i).at(j) == 0){
          for(int k = i-1; k >= 0; k--){
            if(a.at(k).at(j) != 0){
              a.at(i).at(j) = a.at(k).at(j);
              a.at(k).at(j) = 0;
              break;
            }
          }
        }
      }
    }


  }while(repflag);
  result.push_back(res);
}

for(auto x: result) cout << x << endl;

}

C++: #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265


void f(int n){
  int a[100][100];
  rep(i,n){
    rep(j,5){
      cin>>a[n-1-i][j];
    }
  }
  ll ans = 0;
  bool flag = true;



  while(flag){
    
    flag = false;
    rep(i,n){
      rep(j,3){
        if(a[i][j]==0) continue;
        int b = a[i][j];
        int c = 0;
        FOR(k,j,6){
          if(b==a[i][k]) c++;
          else break;
        }
        if(c>=3){
          ans += c*b;
        
          while(b==a[i][j]){
            a[i][j]=0;
            j++;
            flag = true;
          
          }
        }
      }
    }
    rep(i,5){
      rep(j,n){
        if(a[j][i]==0){
          int k = j;
          while(a[k][i]==0&&k<n) k++;
          a[j][i] = a[k][i];
          a[k][i] = 0;
        }
      }
    }
  }

  cout<<ans<<endl;

}

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