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 ISEQUAL(i,a,b,c) Data[a][i] == Data[b][i] && Data[b][i] == Data[c][i] && Data[a][i] != 0

int main(){
	int RowNum = 0;//行数
	int* Data[5];//数値データ[列][行]
	int Points = 0;//ポイント
	bool IsComprete = false;//ルーチン終了判定用
	bool Checker[5] = { false };//行ごと消去判定用
	while(1){
		cin >> RowNum;
		if (RowNum == 0)break;
		//データ代入
		for (int i = 0; i < 5; ++i){
			Data[i] = new int[RowNum];
		}
		for (int i = 0; i < RowNum; ++i){
			for (int j = 0; j < 5; ++j){
				cin >> Data[j][i];
			}
		}

		Points = 0;

		//ゲームルーチン
		while (!IsComprete){
			IsComprete = true;
			for (int i = 0; i < RowNum; ++i){//上から行ごとに
				for (int j = 0; j < 5; ++j){//判定用変数初期化
					Checker[j] = false;
				}
				for (int j = 0; j < 3; ++j){//消滅判定
					if (ISEQUAL(i, j, j + 1, j + 2)){
						Checker[j] = true; Checker[j + 1] = true;
						Checker[j + 2] = true;
						IsComprete = false;//消滅判定時未終了と判断
					}
				}
				for (int j = 0; j < 5; ++j){//消滅処理
					if (Checker[j]){
						Points += Data[j][i];
						Data[j][i] = 0;
					}
				}
			}

			for (int i = RowNum - 1; i > 0; --i){//下から行ごとに
				for (int j = 0; j < 5; ++j){
					if (Data[j][i] == 0){//落下処理
						Data[j][i] = Data[j][i - 1];
						Data[j][i - 1] = 0;
					}
				}
			}
		}

		cout << Points << endl;

		for (int i = 0; i < 5; ++i){
			delete[] Data[i];
		}

	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  for(int H;cin>>H,H;){
    int g[99][5]={};
    for(int i=H-1;i>=0;i--){
      for(int j=0;j<5;j++){
	cin>>g[i][j];
      }
    }
    int ans=0;
    for(;;){
      bool f=false;
      for(int i=0;i<H;i++){
	bool d[99][5]={};
	for(int j=0;j<=2;j++){
	  if(g[i][j]&&g[i][j]==g[i][j+1]&&g[i][j+1]==g[i][j+2]){
	    d[i][j]=d[i][j+1]=d[i][j+2]=true;
	  }
	}
	for(int j=0;j<5;j++){
	  if(d[i][j]){
	    ans+=g[i][j];
	    g[i][j]=0;
	    f=true;
	  }
	}
      }
      if(!f)break;
      for(int i=0;i<5;i++){
	for(int j=0,r=0;j<H;j++,r++){
	  while(r<H&&g[r][i]==0){
	    r++;
	  }
	  g[j][i]=g[r][i];
	}
      }
    }
    cout<<ans<<endl;
  }
}

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

void d(vector<vector<int>> v,int h){
	for(int i=0;i<h;i++){
		for(int j=0;j<v[i].size();j++){
			cout<<v[i][j]<<" ";
		}
		cout<<"\n";
	}
	cout<<"\n";
}

int main (){
	int h;
	while(cin>>h && h){
		vector<vector<int>> v(h,vector<int>(5));
		for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>v[i][j];
		int ans=0;
		while(1){
			int flag=true;
			for(int i=0;i<h;i++){
				int chain;
				for(int j=0;j<5;j++){
					chain=1;
					while(j+1<5 && v[i][j]!=-1 && v[i][j]==v[i][j+1]){
						chain++;
						j++;
					}
					if(chain>=3){
						flag=false;
						ans+=chain*v[i][j];
						for(int k=0;k<chain;k++){
							v[i][j-chain+k+1]=-1;
						}
						break;
					}
				}
			}
			//d(v,h);
			for(int p=0;p<h;p++){
				for(int i=0;i<5;i++){
					for(int j=h-1;j>=1;j--){
						if(v[j][i]==-1){
							for(int k=j;k>=1;k--)swap(v[k][i],v[k-1][i]);
						}
					}
				}
			}

			//d(v,h);
			if(flag)break;
		}
		cout<<ans<<endl;
	}


}

/*
5 8 105
8 5 105
1 2 24
99 98 24
12 13 26
1 22 23
1 13 201
13 16 112
2 24 50
1 82 61
1 84 125
1 99 999
99 1 999
98 99 999
1 99 11
99 1 12
0 0 0
*/

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

int d[10][10], dd[10], H;
int main()
{
  while(true)
  {
    cin >> H;
    if(!H)
      break;
    for(int i = 0; i < H; i++)
      for(int j = 0; j < 5; j++)
        cin >> d[i][j];
    bool f = true;
    int p = 0;
    while(f)
    {
      f = false;
      for(int i = 0; i < 10; i++)
        dd[i] = 0;

      for(int y = 0; y < H; y++)
      {
        int n = 0;
        for(int x = 0; x < 3; x++)
          if(d[y][x] && d[y][x] == d[y][x + 1] && d[y][x + 1] == d[y][x + 2])
            n = x + 2;
        if(n > 0)
        {
          f = true;
          for(int x = n; x >= 0; x--)
          {
            p += d[y][x];
            int tmp = d[y][x];
            d[y][x] = 0;
            if(x == 0 || tmp != d[y][x - 1])
              break;
          }
        }
      }

      for(int y = H - 1; y >= 0; y--)
      {
        for(int x = 0; x < 5; x++)
        {
          if(!d[y][x])
            for(; y - dd[x] >= 0 && !d[y - dd[x]][x]; dd[x]++);
          d[y][x] = d[max(0, y - dd[x])][x];
        }
      }
      for(int x = 0; x < 5; x++)
        for(int y = 0; y < dd[x]; y++)
          d[y][x] = 0;
    }
    cout << p << endl;
  }
}