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;

//?????????????????????????¶????????????????-1???????????????

int main(){
    while(1){
        //??\???
        int h; cin >> h;
        if(!h) break;
        vector<vector<int> >  pu(h, vector<int> (h, 5));
        for(int i = 0; i < h; i++){
            for(int j = 0; j < 5; j++){
                cin >> pu[i][j];
            }
        }


        //??\????????????
        int score = 0;
        bool flag = true;
        while(flag){
            flag = false;
            for(int i = 0; i < h; i++){
                int counter = 1;
                int n = pu[i][0];
                for(int j = 1; j <= 5; j++){
                    if(j == 5){
                        if(counter >= 3 && n != -1){
                            flag = true;
                            score += counter * n;
                            for(int k = j - 1; k >= j - counter; k--){
                                pu[i][k] = -1;
                            }
                        }
                        break;
                    }

                    if(pu[i][j] == n){
                        counter++;
                    }else{
                        if(counter >= 3 && n != -1){
                            flag = true;
                            score += counter * n;
                            for(int k = j - 1; k >= j - counter; k--){
                                pu[i][k] = -1;
                            }
                            break;
                        }else{
                            counter = 1;
                            n = pu[i][j];
                        }
                    }
                }
            }

            //???????????£???????????????
            for(int j = 0; j < 5; j++){
                for(int i = 1; i < h; i++){
                    if(pu[i][j] == -1){
                        for(int k = i - 1; k >= 0; k--){
                            pu[k + 1][j] = pu[k][j];
                        }
                        pu[0][j] = -1;
                    }
                }
            }

            /*cout << "ohana" << endl;
            for(int i = 0; i < h; i++){
                for(int j = 0; j < 5; j++){
                    cout << pu[i][j] << " ";
                }
                cout << endl;
            }
            cout << score << endl;
            int input; cin >> input;*/
        }

        cout << score << endl;
    }

    return 0;
}

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){
          sco+=m*3;S[y][0]=S[y][1]=S[y][2];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){
          sco+=m*3;S[y][1]=S[y][2]=S[y][3];flg=true;
            if(S[y][4]==m){
              sco+=m;S[y][4]=0;
            }
        }
        else if(S[y][3]==m&&S[y][4]==m){
          sco+=m*3;S[y][2]=S[y][3]=S[y][4];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[y][x];S[y2][x]=0;break;
          }
        }
      }
    }
  }
    cout<<sco<<endl;

  }
  return 0;
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

void func(int H){
	int table[H][5];

	for(int i = 0; i < H; i++){
		for(int k = 0; k < 5; k++)scanf("%d",&table[i][k]);
	}

	bool FLG;
	int count = 0;

	while(true){

		FLG = false;

		for(int i = 0; i < H; i++){
			for(int k = 0,p = 0; k <= 2; k++){
				if(table[i][k] == -1)continue;
				for(p = 1; k+p < 5 && table[i][k+p] == table[i][k]; p++);
				if(p >= 3){
					for(int a = k; a < k+p; a++){
						count += table[i][a];
						table[i][a] = -1;
						FLG = true;
					}
					break;
				}
			}
		}

		for(int col = 0; col < 5; col++){
			for(int row = H-2,i = 0; row >= 0; row--){
				if(table[row][col] != -1){
					for(i = row+1; i < H && table[i][col] == -1; i++);
					if(i > row+1){
						table[i-1][col] = table[row][col];
						table[row][col] = -1;
					}
				}
			}
		}

		if(!FLG)break;
	}

	printf("%d\n",count);
}


int main(){

	int H;

	while(true){
		scanf("%d",&H);
		if(H == 0)break;

		func(H);
	}

    return 0;
}