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 PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int H;
int fld[5][10];
void drop(){
      bool pp;
      REP(i,5){
            REP(j,H){
                  if(fld[i][j]==-1){
                        for(int k=j;k<H;k++){
                              if(fld[i][k]!=-1){
                                    int tmp=fld[i][k];
                                    fld[i][k]=fld[i][j];
                                    fld[i][j]=tmp;
                                    break;
                              }
                        }
                  }
            }
      }
}
int main(){
      while(cin>>H&&H){
            for(int i=H-1;i>=0;i--)REP(j,5)cin>>fld[j][i];
            bool update=true;
            int ans=0;
            while(update){
                  update=false;
                  REP(i,H){
                        int s,e,j=0;bool change=false;
                        while(j<5){
                              if(fld[j][i]==-1){
                                    j++;
                                    continue;
                              }
                              s=j;
                              while(fld[s][i]==fld[j][i])j++;
                              if(j-s>=3){
                                    e=j;
                                    change=true;
                                    break;
                              }
                        }
                        if(change){
                              update=true;
                              ans+=(e-s)*fld[s][i];
                              for(int j=s;j<e;j++)fld[j][i]=-1;
                        }
                  }
                  drop();
            }
            cout<<ans<<endl;
      }
}

C++: #include <bits/stdc++.h>
using namespace std;

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

double eps = 1e-10;
const int INF = 1e+9;
typedef pair<int, int> P;
typedef pair<int, P> pp;
const int MAX_N = 105000;

int H;
int maze[16][8];

int search(int x, int y, int c){
	int cnt = 0;
	while(1){
		if(x >= 5 || maze[y][x] != c)
			break;
		x += 1;
		cnt++;
	}
	if(cnt >= 3)
		return cnt;
	else
		return 0;
}

int main() {
	while(cin >> H && H){
		for(int i = 0; i < 16; ++i)
			for(int j = 0; j < 5; ++j)
				maze[i][j] = 0;
		for(int i = 0; i < H; ++i)
			for(int j = 0; j < 5; ++j)
				scanf("%d", &maze[i][j]);
				
		int ans = 0;
		while(1){
			bool next = false;
			for(int y = 0; y < H; ++y){
				int cnt;
				for(int x = 0; x < 3; ++x){
					if(maze[y][x] == 0)	
						continue;
					if(cnt = search(x, y, maze[y][x])){
						ans += maze[y][x] * cnt;
						for(int i = x; i < x + cnt; ++i){
							maze[y][i] = 0;
						}
						next = true;
						break;
					}
				}
			}
			if(!next)
				break;
			while(1){
				bool changed = false;
				for(int y = H - 1; y > 0; --y){
					for(int x = 0; x < 5; ++x){
						if(maze[y][x] == 0 && maze[y - 1][x]){
							swap(maze[y][x], maze[y - 1][x]);
							changed = true;
						}
					}
				}
				if(!changed)
					break;
			}
		}
		cout << ans << endl;
	}
	return 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];
        }
      }
    }
    cout << p << endl;
  }
}