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 <iostream>
#include <vector>
using namespace std;

int main() {

  while( true ) {

    long long int h;
    cin >> h;
    if ( h == 0 ) break;

    vector< vector< long long int > > v;

    for ( long long int y = 0; y < h; y++ ) {

      vector< long long int > w;
      w.push_back( 0 );

      for ( long long int x = 0; x < 5; x++ ) {

	long long int in;
	cin >> in;
	w.push_back( in );

      }

      w.push_back( 0 );

      v.push_back( w );

    }

    long long int ans = 0;

    while( true ) {

      bool f = false;

      for ( long long int y = 0; y < h; y++ ) {

	long long int cnt = 0;
	long long int num = 0;

	for ( long long int x = 0; x < 7; x++ ) {

	  if ( v[y][x] != num ) {
	    if ( cnt >= 3 ) {
	      ans += cnt * num;
	      f = true;
	      for ( long long int k = 0; k < cnt; k++ ) {
		v[y][x-k-1] = 0;
	      }
	    }
	    cnt = 1;
	    num = v[y][x];
	  }else {
	    cnt++;
	  }

	}

      }

      if ( f == false ) {
	cout << ans << endl;
	break;
      }

      for ( long long int x = 1; x <= 5; x++ ) {

	long long int m = -1;

	for ( long long int y = h - 1; y >= 0; y-- ) {

	  if ( v[y][x] == 0 && m == -1 ) {
	    m = y;
	  }
	  if ( v[y][x] != 0 && m != -1 ) {
	    v[m][x] = v[y][x];
	    m--;
	  }

	}

      }

    }

  }

  return 0;

}

C++: #include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;

int board[10][5];

int main(){ _;
  int h;
  while(cin>>h,h!=0){
    REP(i,10)REP(j,5)board[i][j]=0;
    REP(i,h){
      REP(j,5){
	cin>>board[h-i-1][j];
      }
    }
    int sum=0;
    bool chain=false;
    do{
      chain=false;
      REP(i,h){
	REP(j,3){
	  if(board[i][j]==0)continue;
	  int k=j+1;
	  for(;k<5;k++){
	    if(board[i][j]!=board[i][k])break;
	  }
	  if(k-j>=3){
	    sum+=board[i][j]*(k-j);
	    for(;j<k;j++)
	      board[i][j]=0;
	    break;
	  }
	}
      }
      REP(j,5){
	REP(i,h-1){
	  if(board[i][j]==0){
	    int k=i+1;
	    for(;k<10;k++){
	      if(board[k][j]!=0){
		board[i][j]=board[k][j];
		board[k][j]=0;
		chain=true;
		break;
	      }
	    }
	  }
	}
      }
      // REP(i,10){
      // 	REP(j,5)
      // 	  cout<<board[i][j]<<" ";
      // 	cout<<endl;
      // }
      // cout<<endl;
    }while(chain);
    cout<<sum<<endl;
  }
}

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

void p(int ma[][5],int h){
  cout<<endl;
  for(int i=0;i<h;i++){
    for(int j=0;j<5;j++){
      if(j)cout<<" ";
      cout<<ma[i][j];
    }
    cout<<endl;
  }
}

int main(){
  int h;
  int ma[10][5];
  while(cin>>h,h){
    for(int i=0;i<h;i++){
      for(int j=0;j<5;j++)
	cin>>ma[i][j];
    }
    int ans=0;
    int flag=1;
    while(flag){
      flag=0;
      for(int x=0;x<h;x++){
	for(int i=0;i<3;i++){
	  if(ma[x][i]==0)continue;
	  int k=1;
	  for(int j=i+1;j<5;j++){
	    if(ma[x][j]==ma[x][j-1])k++;
	    else break;
	  }
	  if(k>=3){
	    flag=1;
	    for(int j=0;j<k;j++){
	      ans+=ma[x][i+j];
	      ma[x][i+j]=0;
	    }
	    break;
	  }
	}
      }
      // p(ma,h);
      for(int i=0;i<5;i++){
	for(int j=h-1;j>=0;j--){
	  if(ma[j][i]==0){
	    //cout<<"a"<<endl;
	    for(int k=j;k>=0;k--){
	      if(ma[k][i]!=0){
		swap(ma[j][i],ma[k][i]);
		break;
	      }
	    }
	  }
	}
      }
      // p(ma,h);
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include<cstdio>
using namespace std;

int h, d[10][5];

int check() {
  int counter = 0;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < 3; j++) {
      if (d[i][j] == -10) continue;
      if (d[i][j] == d[i][j + 1] && d[i][j] == d[i][j + 2]) {
        int num = d[i][j];
        for (int k = j; k < 5; k++) {
          if (d[i][k] == num) d[i][k] = -1, counter += num;
          else break;
        }
        break;
      }
    }
  }
  return counter;
}

void fall() {
  for (int j = 0; j < 5; j++) {
    int counter = 0;
    for (int i = h - 1; i >= 0; i--) {
      if (d[i][j] == -10) break;
      if (d[i][j] == -1) counter++;
      else d[i + counter][j] = d[i][j];
    }
    for (int i = 0; i < counter; i++) d[i][j] = -10;
  }
}

int main() {
  while (1) {
    scanf("%d", &h);
    if (h == 0) break;
    for (int i = 0; i < h; i++) for (int j = 0; j < 5; j++) scanf("%d", &d[i][j]);
    int sum = 0;
    while (1) {
      int counter = check();
      if (counter == 0) break;
      sum += counter;
      fall();
    }
    printf("%d\n", sum);
  }
}