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>

using namespace std;

#define WIDTH 5
#define MAX_HEIGHT 10
#define CHAIN_SIZE 3
#define EXTINCT -1//?¶?????????????
#define EMPTY -2//???????????¨?????????

void down(int h,  int stones[MAX_HEIGHT][WIDTH]){

  for(int i=0;i<h;i++){
    for(int j=0;j<WIDTH;j++){
      if(stones[i][j] == EXTINCT){
	int c;
	for(c=i; c<h-1; c++){
	  if(stones[c+1][j] == EMPTY){
	    break;
	  }	  
	  stones[c][j] = stones[c+1][j];
	}

	while(c<h){
	  stones[c][j] = EMPTY;
	  c++;
	}
      }
      
      if(stones[i][j] == EXTINCT){
	//???????????¨???????????????????????????EXTINCT?????£????????????????????????
	i--;
      }
    }
  }
  
 
}

int main(){
  int h;
  int stones[MAX_HEIGHT][WIDTH];
  cin>>h;

  while(h != 0){
    int ans = 0;
    for(int i=h-1;i>=0;i--){
      for(int j=0;j<WIDTH;j++){
	cin>>stones[i][j];
      }
    }


    bool finish = false;

    while(!finish){

     
      
      bool chained = false;
      for(int i=0;i<h;i++){
	int s = 0;
	int e = 0;
	for(int j=0;j<WIDTH-1;j++){
	  if(stones[i][j]==stones[i][j+1] && stones[i][j]!=EXTINCT && stones[i][j]!=EMPTY){
	    e++;
	    if(e-s+1 >= CHAIN_SIZE){//3??\????????£?¶??????????
	      int num = stones[i][s];
	      int c = 0;
	      chained = true;
	      while(stones[i][s] == num){
		stones[i][s] = EXTINCT;
		s++;
		c++;
	      }
	      ans += c*num;
	      e=s;
	    }
	  }else{
	    s = j+1;
	    e = j+1;
	  }
	}
	
      }

      down(h,stones);
      
      if(!chained){
	finish = true;
      }
    }
    
    cout<<ans<<endl;
    cin>>h;
  }
  

  return 0;
}

C++: #include<iostream>
#include<vector>
#include<stdio.h>
using namespace std;

vector<vector<int> > matrix;

int main(){
    int H;
    while(scanf("%d",&H) && H){
        vector<int> temp(5,0);
        matrix.push_back(temp);
        for (int i = 0; i < H; i++) {
            vector<int> temp(5,0);
            for (int j = 0; j < 5; j++)
                cin >> temp[j];
            matrix.push_back(temp);
        }

        bool flag = true;
        int score = 0;


        while(flag){
        // for (int i=0; i < H+1; i++) {                                                                                                                               
        //     for (int j=0; j < 5; j++)                                                                                                                               
        //      cout << matrix[i][j];                                                                                                                                  
        //     cout << endl;                                                                                                                                           
        // }                                                                                                                                                           
        // cout << "====================" << endl;                                                                                                                     



            // ?¶????????????¨????????¢??????                                                                                                                                    
            // ?¶?????????????-1?????£??\                                                                                                                                      
            for (int i=0; i < H+1; i++) {
                int count = 1, num=-1;
                flag = false;
                for (int j=0; j <3 ; j++) {
                    if(matrix[i][j]!=-1 &&
                       matrix[i][j]!=0 &&
                       matrix[i][j]==matrix[i][j+1] &&
                       matrix[i][j+1]==matrix[i][j+2]){
                        flag = true;
                        num = matrix[i][j];
                        break;
                    }
                }
                if(flag){
                    for (int j=0; j < 5; j++) {
                        if(matrix[i][j]==num){
                            score += num;
                            matrix[i][j] = -1;
                        }
                    }
                }



            }
            // ???????????????????¢????                                                                                                                                        
            // ???????????????????????????0?????£??\                                                                                                                               
            bool fail_flag;
            do{
               	fail_flag = false;
		for (int i=H; i > 0; i--) {
                    for (int j=0; j < 5; j++) {
			if(matrix[i][j]==-1){
                            fail_flag = true;
                            flag = true;
                            if(matrix[i-1][j]!=0){
				matrix[i][j] = matrix[i-1][j];
				matrix[i-1][j] = -1;
                            }
                            else
                                matrix[i][j] = 0;

			}
                    }
		}
                for (int j=0; j < 5; j++)
                    matrix[0][j] = 0;
            }while(fail_flag);
	}
        cout << score << endl;
	matrix.clear();
    }
    return 0;
}