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;
typedef long long ll;
  
#define REP(i,n) for(int i=0;i<(int)(n);i++)
  
  
int main()
{
    int h;
    while(1==1)
    {
        scanf("%d\n",&h);
        if(h==0)break;
        int ban[15][5]={};
        int del=0;
        long int ans=0;
        REP(y,h)REP(x,5)scanf("%d ",&ban[y][x]);
        do{
            del=0;
            REP(y,h)
            {
                int center=ban[y][2];
                int centnum=1;
                if(ban[y][1]==center)
                {
                    centnum++;
                    if(ban[y][0]==center)centnum++;
                }
                if(ban[y][3]==center)
                {
                    centnum++;
                    if(ban[y][4]==center)centnum++;
                }
                if(centnum>=3 && center!=0)
                {
                    ban[y][2]=0;
                    if(ban[y][1]==center)
                    {
                        ban[y][1]=0;
                        if(ban[y][0]==center)ban[y][0]=0;
                    }
                    if(ban[y][3]==center)
                    {
                        ban[y][3]=0;
                        if(ban[y][4]==center)ban[y][4]=0;
                    }
                    ans+=centnum*center;
                    del++;
                }
            }
            REP(x,5)REP(i,1000)REP(y,h-1)if(ban[y][x]!=0&&ban[y+1][x]==0)swap(ban[y][x],ban[y+1][x]);
            /*
            REP(y,h)
            {
                REP(x,5)
                {
                    printf("%d ",ban[y][x]);
                }
                printf("\n");
            }
            printf("###\n");
            */
        }while(del>0);
        printf("%ld\n",ans);
    }
    return 0;
}

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

        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));
        rep(r, H) rep(c, 5) cin >> board[r][c];
        cout << solve(board) << endl;
    }
    return 0;
}