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) for(int i = 0;i < n ;++i)

int tile[11][5];

int main()
{
  int h;

  while(cin >> h,h){
    REP(i,11)REP(j,5){
      tile[i][j] = -1;
    }
    REP(i,h)REP(j,5){
      cin >> tile[h-1-i][j];
    }
    int ans = 0;
    bool update = false;
    while(true){
      update = false;
      REP(it,11){
        bool t1 = tile[it][0] == tile[it][1] && tile[it][0] != -1; 
        bool t2 = tile[it][1] == tile[it][2] && tile[it][1] != -1; 
        bool t3 = tile[it][2] == tile[it][3] && tile[it][2] != -1; 
        bool t4 = tile[it][3] == tile[it][4] && tile[it][3] != -1; 
        bool y1 = t1 && t2;
        bool y2 = t2 && t3;
        bool y3 = t3 && t4;
        if(y1 && y2 && y3){
          ans += tile[it][0]*5;
          REP(i,5){
            tile[it][i]=-1;
          }
          update = true;
        }
        else if(y1 && y2 || y2 && y3){
          ans += tile[it][y3]*4;
          REP(i,4){
            tile[it][i + y3]=-1;
          }
          update = true;
        }
        else if(y1 || y2 || y3){
          ans += tile[it][2]*3;
          REP(i,3){
            tile[it][i + y2 + ((int)y3)*2] = -1;
          }
          update =true;
        }
      }
      REP(it,11){
        REP(i,5){
          if(tile[it][i] == -1){
            int itt = it;
            while(tile[++itt][i] == -1 && itt != 10);
            swap(tile[it][i],tile[itt][i]);
          }
        }
      }
    if(!update)break;
    }
    cout << ans << endl;
  }
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int h;
  while(cin>>h,h){
    int a[10][5],ans=0;
    for(int i=0;i<h;i++)
      for(int j=0;j<5;j++)cin>>a[i][j];
    bool f=1;
    while(f){
      f=0;
      for(int i=0;i<h;i++){
	int c=1,p=0;
	for(int j=1;j<5;j++)
	  if(a[i][p]==a[i][j])c++;
	  else if(c<3)c=1,p=j;
	  else {
	    for(int j=0;j<c;j++)a[i][p+j]=0;
	    ans+=c*a[i][p];
	  }
      }
      for(int i=0;i<5;i++)
	for(int j=1;j<h;j++)
	  for(int k=j;k>0;k--)
	    if(!a[k][i]&&a[k-1][i])swap(a[k][i],a[k-1][i]),f=1;
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

#define fr first
#define sc second
#define mp make_pair

typedef long long int64;
typedef pair< int, int > iP;
typedef pair< iP, int > iiP;

const int INF = 2 << 28;
const double EPS = 1e-10;

int H, mas[20][6];
int ans;


bool canDelete() {
    bool ret = false;
    for(int i = 0; i < H; i++) {
        int prev = -1, cnt = 0;
        for(int j = 0; j < 6; j++) {
            if(!(~prev)|| mas[i][j] == prev) cnt++, prev = mas[i][j];
            else {
                if(cnt >= 3) {
                    if(prev) ret = true;
                    ans += prev * cnt;
                    for(int k = j - 1; k >= j - cnt; k--)
                        mas[i][k] = 0;
                }
                cnt = 1;
                prev = mas[i][j];
            }
        }
    }
    return ret;
}

void drop() {
    for(int i = H - 1; i > 0; i--) {
        for(int j = 0; j < 5; j++) {
            if(mas[i][j] == 0) {
                for(int k = i - 1; k >= 0; k--) {
                    if(mas[k][j] != 0) {
                        mas[i][j] = mas[k][j];
                        mas[k][j] = 0;
                        break;
                    }
                }
            }
        }
    }
}

int main() {

    while(cin >> H, H) {
        ans = 0;
        memset(mas, 0, sizeof(mas));
        for(int i = 0; i < H; i++) {
            for(int j = 0; j < 5; j++) {
                cin >> mas[i][j];
            }
        }

        while(canDelete()) {
            drop();
        }
        cout << ans << endl;
    }
}