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>
#define rep(i,j) for (int (i)=0;(i)<(int)(j);++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

int H;
int solve(vector<vector<int>> board) {
    bool update = true;
    int score = 0, prev_score = 0;
    while (update) {
        update = false;

        // delete
        rep(r, H) {
            int tmp = 0, prev = -1;
            rep(c, 5) {
                if (board[r][c] == -100) {
                    prev = -1;
                    tmp = 0;
                    continue;
                }
                if (prev == -1) {
                    prev = board[r][c];
                    tmp++;
                }
                else {
                    if (prev == board[r][c]) {
                        tmp++;
                    }
                    else {
                        if (tmp >= 3 and prev > 0) {
                            score += prev * tmp;
                            for (int k=c-tmp; k<c; ++k) board[r][k] = -100;
                        }
                        prev = board[r][c];
                        tmp = 1;
                    }
                }
            }
            if (tmp >= 3 and prev > 0) {
                score += prev * tmp;
                for (int k = 5-tmp; k < 5; ++k) board[r][k] = -100;
            }
        }

        // fall
        for (int r = H-1; r >= 0; --r) {
            for (int c = 0; c < 5; ++c) {
                if (board[r][c] > 0) {
                    for (int rr=r+1; rr < H; ++rr) {
                        if (board[rr][c] == -100) {
                            board[rr][c] = board[rr-1][c];
                            board[rr-1][c] = -100;
                        }
                        else break;
                    }
                }
            }
        }

        // rep(r, H) {
        //     rep(c, 5) {
        //         if (board[r][c] == -100) {
        //             cout << "  ";
        //         }
        //         else cout << board[r][c] << " ";
        //     }
        //     cout << endl;
        // }

        if (prev_score < score) {
            update = true;
        }
        prev_score = score;

    }
    return score;
}

int main() {
    while (cin >> H, H) {
        vector<vector<int>> board(H, vector<int>(5, 0));
        rep(r, H) rep(c, 5) cin >> board[r][c];
        cout << solve(board) << endl;
    }
    return 0;
}

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


 int main(){
	 
	 int h;
	 while(1){
		 int p=0;
		 int flag=1;
		 int x;
		cin >> h;
		if(h == 0) break;
		vector<vector<int> > A(5);
		for(int j = h-1; j >= 0; j--){
			for(int i = 0; i< 5; i++){
				cin >> x;
				A[i].push_back(x);
			}
		}
		for(int i = 0; i< 5; i++){
			reverse(A[i].begin(), A[i].end());
			}


		while(1){
			int flag=0;
		for(int i = 0; i < h; i++){
			int count=0;
			int mem=-1;
			//一行の処理開始
			for(int j=0; j< 5;j++){
				if(mem==A[j][i]) count++;
				else {
					mem =A[j][i];
					count = 0;
				}
				if(count > 1) {
					A[j-2][i] +=10;
					A[j-1][i] +=10;
					A[j][i] +=10;
					if(mem!=0) flag =1;
				}
			}
			for(int k = 0; k < 5 ; k++){
				if(A[k][i] >=10){
					p += A[k][i]%10;
					A[k][i]=0;
				}
			}//一行の処理終了
		}
		for(int i= 0; i < 5 ; i++){
			vector<int> B(A[i]);
			int counter=0;
			for(int j = 0 ; j < h ; j++){
				if(B[j] !=0){
					A[i][counter] = B[j];
					counter+=1;
				}
			}
			for(;counter<h; counter++){
				A[i][counter] = 0;
			}
		} 
		if(flag == 0) break;
		}
		cout <<p <<endl;
	 }
		 



	return 0;
 }

C++: #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;

int main() {
  int n;
  while(R n && n) {
    vector<int> a[5];
    int d[n][5];
    rep(i,n) {
      rep(j,5) R d[i][j];
    }
    rep(i,5) {
      rrep(j,n) a[i].pb(d[j][i]);
    }
    int ans=0;
    while(1) {
      bool ck=true;
      rep(i,n) {
	if(a[2][i]==0) continue;
	int cnt=1;
	for(int j=1; j>=0; j--) {
	  if(a[j][i]!=a[2][i]) break;
	  else cnt++;
	}
	for(int j=3; j<=4; j++) {
	  if(a[j][i]!=a[2][i]) break;
	  else cnt++;
	}
	if(cnt<3) continue;
	for(int j=1; j>=0; j--) {
	  if(a[j][i]!=a[2][i]) break;
	  else a[j][i]=0;
	}
	for(int j=3; j<=4; j++) {
	  if(a[j][i]!=a[2][i]) break;
	  else a[j][i]=0;
	}
	ans+=a[2][i]*cnt;
	a[2][i]=0;
	ck=false;
      }
      rep(i,5) {
	fill(remove(a[i].begin(),a[i].end(),0),a[i].end(),0);
      }
      if(ck) break;
    }
    pr(ans);
  }
  return 0;
}