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 <cstdlib>

using namespace std;

/*
void po( int b[ 10 ][ 5 ] ) {
  for( int i = 0; i < 10; i++) {
    for( int j = 0; j < 5; j++ ) {
      cout << b[ i ][ j ] << " " << flush;
    }
    cout << endl;
  }
}
*/
int del( int b[ 10 ][ 5 ], int h ) {
  int point = 0;
  for( int i = 9; i > 9 - h; i--) {
    int seqv = -1;
    int seqn = 0;
    for( int j = 0; j < 5; j++ ) {
      if( b[ i ][ j ] == seqv ) {
        seqn++;
      } else {
        if( seqn >= 3 ) {
          point += ( seqv * seqn );
          for( int k = 0; k < seqn; k++ ) {
            b[ i ][ j - k - 1 ] = -1;
          }
        }
        seqn = 1;
        seqv = b[ i ][ j ];
      }
    }
    if( seqn >= 3 ) {
      point += ( seqv * seqn );
      for( int k = 0; k < seqn; k++ ) {
        b[ i ][ 5 - k - 1 ] = -1;
      }
    }
  }
  
  for( int i = 9; i > 9 - h; i--) {
    for( int j = 0; j < 5; j++ ) {
//      cout << "I: " << i << " J: " << j << " P: " << point << endl;
//      po( b );
      if( b[ i ][ j ] == -1 ) {
        while( 1 ) {
          if( i != 0 && b[ i ][ j ] == -1 ) {
            for( int k = i; k >= 0; k-- ) {
              b[ k ][ j ] = b[ k - 1 ][ j ];
            }
            b[ 0 ][ j ] = 0;
          } else {
            break;
          }
        }
      }
    }
  }

  return point;
}


int main() {
  while( 1 ) {
    int b[ 10 ][ 5 ] = { 0 };
    int h;
    cin >> h;
    if( h == 0 ) { break; }
    for( int i = 9 - h + 1; i < 10; i++) {
      for( int j = 0; j < 5; j++ ) {
        cin >> b[ i ][ j ];
      }
    }
    int total = 0;
    while( 1 ) {
      int p = del( b, h );
      if( p == 0 ) { break; }
      total += p;
    }

    cout << total << endl;
  }
  return EXIT_SUCCESS;
}

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

int main()
{
	while(true){
		int H;
		cin >> H;

		if(H==0)
			break;

		int S[10][5];			// 石の並び
		for(int y=0; y<H; y++)
			for(int x=0; x<5; x++)
				cin >> S[y][x];

		int sco = 0;			// スコア

		while(true){
			bool flg = false;

			for(int y=0; y<H; y++){			// 消滅のステップ
				int m = S[y][2];
				if(m==0)
					continue;

				if(S[y][0]==m && S[y][1]==m){			// 0～2が同じ
					sco += m*3;  S[y][0] = S[y][1] = S[y][2] = 0;  flg = true;
					if(S[y][3]==m){
						sco += m;  S[y][3] = 0;
						if(S[y][4]==m){
							sco += m;  S[y][4] = 0;
						}
					}
				}
				else if(S[y][1]==m && S[y][3]==m){		// 1～3が同じ
					sco += m*3;  S[y][1] = S[y][2] = S[y][3] = 0;  flg = true;
					if(S[y][4]==m){
						sco += m;  S[y][4] = 0;
					}
				}
				else if(S[y][3]==m && S[y][4]==m){		// 2～4が同じ
					sco += m*3;  S[y][2] = S[y][3] = S[y][4] = 0;  flg = true;
				}
			}

			if(!flg)
				break;

			for(int x=0; x<5; x++){			// 落下のステップ
				for(int y=H-1; y>=0; y--){
					if(S[y][x]!=0)
						continue;

					for(int y2=y-1; y2>=0; y2--){		// 空きより上を探す
						if(S[y2][x]!=0){
							S[y][x] = S[y2][x];  S[y2][x] = 0;  break;
						}
					}
				}
			}
		}

		cout << sco << endl;
	}

	return 0;
}