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;

#define REP(i,n) for(int i=(0); i<n; ++i)

double eps = 1e-10;
const int INF = 1e+9;
typedef pair<int, int> P;
typedef pair<int, P> pp;
const int MAX_N = 105000;

int H;
int maze[16][8];

int search(int x, int y, int c){
	int cnt = 0;
	while(1){
		if(maze[y][x] != c)
			break;
		x += 1;
		cnt++;
	}
	if(cnt >= 3)
		return cnt;
	else
		return 0;
}

int main() {
	while(cin >> H && H){
		for(int i = 0; i <= H; ++i)
			for(int j = 0; j < 5; ++j)
				maze[i][j] = 0;
		for(int i = 0; i < H; ++i)
			for(int j = 0; j < 5; ++j)
				scanf("%d", &maze[i][j]);
				
		int ans = 0;
		vector<pp> vec;
		while(1){
			for(int y = 0; y < H; ++y){
				int cnt;
				for(int x = 0; x < 3; ++x){
					if(maze[y][x] == 0)	
						continue;
					if(cnt = search(x, y, maze[y][x])){
						ans += maze[y][x] * cnt;
						for(int i = x; i < x + cnt; ++i){
							maze[y][i] = 0;
						}
						vec.push_back(pp(y, P(x, x + cnt)));
						break;
					}
				}
			}
			if(vec.empty())
				break;
			sort(vec.begin(), vec.end());
			for(int i = 0; i < vec.size(); ++i){
				for(int y = vec[i].first; y > 0; --y){
					for(int x = vec[i].second.first; x < vec[i].second.second; ++x){
						maze[y][x] = maze[y - 1][x];
					}
				}
			}
			vec.clear();
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int solve(int h,vector<vector<int>> &f){
  int res=0;
  bool update=false;
  for(int i=0;i<h;i++){
    int cnt=1;
    for(int j=1;j<=5;j++){
      if(j<5 && f[i][j-1]==f[i][j] && f[i][j-1]!=0){
	cnt++;
      }
      else{
	if(cnt>=3){
	  update=true;
	  int num=f[i][j-1];
	  for(int k=j-cnt;k<j;k++){
	    res+=num;
	    f[i][k]=0;
	  }
	}
	cnt=1;
      }
    }
  }

  for(int i=0;i<h*2;i++){
    for(int j=h-1;j>0;j--){
      for(int k=0;k<5;k++){
	if(f[j][k]==0 && f[j-1][k]!=0){
	  swap(f[j][k],f[j-1][k]);
	}
      }
    }
  }

  if(update){
    return res+solve(h,f);
  }
  else{
    return res;
  }
}
int main(){
  int h;
  while(cin>>h,h){
    vector<vector<int>> f(h,vector<int>(5,0));
    for(int i=0;i<h;i++){
      for(int j=0;j<5;j++){
	cin>>f[i][j];
      }
    }

    cout<<solve(h,f)<<endl;
  }
  
  return 0;
}

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);
  }
}