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,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)

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

	int H;
	int T[10][5];
	while (cin >> H)
	{
		if (H == 0) return 0;

		rep(y, 0, H) rep(x, 0, 5) cin >> T[y][x];

		int ans = 0;
		bool f = true;
		while (f)
		{
			f = false;

			rep(y, 0, H)
			{
				rep(k, 0, 3)
				{
					if (T[y][k] < 0) continue;
					int c = T[y][k];
					int kk = k + 1;
					while (T[y][kk] == c)
					{
						kk++;
						if (kk == 5) break;
					}
					int len = kk - k;
					if (3 <= len)
					{
						ans += len * c;
						//cout << " " << ans << endl;
						rep(ii, k, kk) T[y][ii] = -1;
						f = true;
					}
				}
			}

			rep(x, 0, 5)
			{
				vector<int> t;
				rrep(y, H-1, 0) if (0 <= T[y][x]) t.push_back(T[y][x]);
				rep(y, 0, H) T[y][x] = -1;
				rep(i, 0, t.size()) T[H - 1 - i][x] = t[i];
			}
		}

		cout << ans << endl;
	}
}

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


int main() {
    int h,p,ans,sum;
    ans=0;
    scanf ("%d",&h);
    while(h){
      ans=0;
      vector<vector<int> > a(h+45,vector<int>(5,0));
      for(int s=h-1;s>=0;s--){
        for(int t=0;t<5;t++){
          scanf ("%d",&a[s][t]);
          ans=ans+a[s][t];
        }
      }
      p=100;
      while(p){
        for(int s=0;s<h;s++){
          if(a[s][0]==a[s][1]){
            if(a[s][1]==a[s][2]){
              if(a[s][2]==a[s][3]){
                if(a[s][3]==a[s][4]){
                  for(int t=0;t<5;t++){
                    a[s][t]=0;
                  }
                }
                else{
                  for(int t=0;t<4;t++){
                    a[s][t]=0;
                  }
                }
              }
              else{
                for(int t=0;t<3;t++){
                  a[s][t]=0;
                }
              }
            }
            else{
              if(a[s][2]==a[s][3]){
                if(a[s][3]==a[s][4]){
                  for(int t=2;t<5;t++){
                    a[s][t]=0;
                  }
                }
              }
            }
          }
          else{
            if(a[s][1]==a[s][2]){
              if(a[s][2]==a[s][3]){
                if(a[s][3]==a[s][4]){
                  for(int t=1;t<5;t++){
                    a[s][t]=0;
                  }
                }
                else{
                  for(int t=1;t<4;t++){
                    a[s][t]=0;
                  }
                }
              }
            }
            else{
              if(a[s][2]==a[s][3]){
                if(a[s][3]==a[s][4]){
                  for(int t=2;t<5;t++){
                    a[s][t]=0;
                  }
                }
              }
            }
          }
        }
        for(int t=0;t<5;t++){
          for(int k=0;k<h;k++){
            for(int s=0;s<h;s++){
              if(a[s][t]==0){
                for(int r=s;r<h;r++){
                    a[r][t]=a[r+1][t];
                }
              }
            }
          }
        }
        p--;
      }
      sum=0;
      for(int s=h-1;s>=0;s--){
        for(int t=0;t<5;t++){
          sum=sum+a[s][t];
        }
        //printf("%d %d %d %d %d\n",a[s][0],a[s][1],a[s][2],a[s][3],a[s][4]);
      }
      ans=ans-sum;
      printf("%d\n",ans);
      scanf ("%d",&h);
    }
}

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;
    }
}