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;
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define pb push_back
int H;
int W= 5;
int S[10][10];
int B[10][10];
int main() {
  while(true){
    cin >> H;
    if(H==0)return 0;
    int ans = 0;
    rep(i,H)
      {
	rep(j,W)
	  {
	    cin>>S[i][j];
	    
	  }
      }
  
    while(1)
      {
	 bool flag=true;
	memset(B,0,sizeof(B));
	/*rep(i,H)
	  {
	    rep(j,W)
	      {
		printf("%d ",S[i][j]);
		
	      }
	      }*/
	rep(i,H)
	  {
	    repi(j,2,W)
	      {
		if(S[i][j]!=-1 && S[i][j]==S[i][j-1] && S[i][j-1]==S[i][j-2])
		  {
		    B[i][j]=B[i][j-1]=B[i][j-2]=1;
		    flag=false;
		  }
	      }
	  }
	//printf("%d",flag);
	if(flag)break;
	rep(k,H)
	  {
	    //int k = H-i-1;
	    rep(j,W)
	      {
		if(B[k][j])
		  {
		    ans += S[k][j];
		    int p = k;
		    while(true)
		      {
			if(p==0||S[p-1][j]==-1)
			  {
			    S[p][j]=-1;
			    break;
			  }
			else
			  {
			    S[p][j]=S[p-1][j];
			    p--;
			  }
		      }
		     		   
		  }
	      }
	  }
      }
    printf("%d\n",ans);
  }
}

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

int h;
int b[10][5];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(cin >> h, h) {
		memset(b, 0, sizeof b);
		for(int y = 0; y < h; y++) {
			for(int x = 0; x < 5; x++) {
				cin >> b[y][x];
			}
		}

		int ans = 0;
		bool flag = true;
		while(flag) {
			flag = false;
			for(int y = 0; y < h; y++) {
				for(int len = 5; len >= 3; len--) {
					for(int s = 0; s + len <= 5; s++) {
						if(b[y][s] == 0) continue;
						bool same = true;
						for(int x = s; x < s + len - 1; x++) {
							same &= b[y][x] == b[y][x + 1];
						}
						if(same) {
							flag = true;
							ans += b[y][s] * len;
							for(int x = s; x < s + len; x++) {
								b[y][x] = 0;
							}
						}
					}
				}
			}

			for(int y = h - 1; y >= 1; y--) {
				for(int x = 0; x < 5; x++) {
					if(b[y][x] == 0) {
						int ny = y;
						while(ny >= 0 && b[ny][x] == 0) ny--;
						if(ny >= 0) {
							swap(b[ny][x], b[y][x]);
						}
					}
				}
			}
		}
		cout << ans << endl;
	}

}

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

#define REP(i, a, b) for(int i = (a); i < int(b); ++i)
#define rep(i, n) REP(i, 0, n)

constexpr int WIDTH = 5;
constexpr int EMPTY = 0;
constexpr int NUM = 3;

int disappear(vector<vector<int>> &board) {
	const int h = board.size();

	int res = 0;
	rep(y, h) {
		int l = 0;

		while(l <= WIDTH - NUM) {
			int r = l + 1;
			while(r < WIDTH && board[y][l] == board[y][r]) {
				++r;
			}

			if(r - l >= NUM) {
				res += (r - l) * board[y][l];
				REP(x, l, r) board[y][x] = EMPTY;
			}

			l = r;
		}
	}
	return res;
}

void fall(vector<vector<int>> &board) {
	const int h = board.size();

	rep(x, WIDTH) {
		queue<int> que;
		for(int y = h - 1; y >= 0; --y) {
			if(board[y][x]) que.push(board[y][x]);
		}

		for(int y = h - 1; y >= 0; --y) {
			if(que.empty()) {
				board[y][x] = EMPTY;
			}
			else {
				board[y][x] = que.front();
				que.pop();
			}
		}
	}
}

int solve(vector<vector<int>> &board) {
	int score = 0;
	int point;

	while((point = disappear(board))) {
		score += point;
		fall(board);
	}
	return score;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	for(int h; cin >> h && h;) {
		vector<vector<int>> board(h, vector<int>(WIDTH));
		for(auto &line : board) for(auto &e : line) cin >> e;
		cout << solve(board) << endl;
	}
	return EXIT_SUCCESS;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
//#define INF (1LL<<59)


int h;

void del(vector<vector<int>> &v){
    rep(i,h){
        rep(j,5){
            
            int base = v[i][j];
            if(base==0)continue;
            int num = 0;
            rep(k,5){
                if(j+k>5)break;
                if(base==v[i][j+k])num++;
            }
            if(num<3)continue;
            rep(k,5){
                if(j+k>5)break;
                if(base==v[i][j+k]){
                    v[i][j+k]=0;
                }else break;
            }
            
        }
    }
}

bool fall(vector<vector<int>> &v){
    bool ret = false;
    rep(i,h-1){
        rep(j,5){
            if(v[i+1][j]==0 && v[i][j]!=0){
                ret|=true;
                swap(v[i+1][j],v[i][j]);
            }
        }
    }
    return ret;
}

int main(){
    while(cin>>h&&h){
        int sum = 0;
        vector<vector<int>> fie(h,vector<int>(5));
        rep(i,h){
            rep(j,5){
                cin>>fie[i][j];
                sum+=fie[i][j];
            }
        }
        
        while(1){
            del(fie);
            
            bool res = fall(fie);
            if(res==false)break;
        }
        int t = 0;
        rep(i,h){
            rep(j,5){
                t+=fie[i][j];
            }
        }
    
        cout<<sum-t<<endl;
    }
}