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 <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)

using namespace std;
const int MOD = 1000000007;


typedef long long int ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;

//石の座標と個数を指定して消す関数．
void del(vector<vector<int> >& stone,int x,int y,int nums){
    rep(i,nums){
        stone[y][x-i]=stone[y-1][x-i];
        if(stone[y-1][x-i]!=0){
            del(stone,x-i,y-1,1);
        }
    }
}

int soleve(vector<vector<int> > stone,int h){
    int score = 0;
    bool onemore; // stoneの配置が変わった場合もう一度上からみるフラグ

    do{
        onemore = false;
        rep(i,h){
            int pre = stone[i+1][0];
            int same = 1;
            rep(j,4){
                
                if(pre == stone[i+1][j+1] && pre != 0){
                //同じ要素だった
                    same++;
                }else if(same >= 3){
                //違う要素だったがそれまでに3個連続していた
                    score += same * stone[i+1][j];
                    del(stone,j,i+1,same);
                    same = 1;
                    pre = stone[i+1][j+1];
                    onemore = true;
                }else {
                //それ以外
                    same = 1;
                    pre = stone[i+1][j+1];
                }
            }

            if(same >= 3){
            //最後の行の最後を確認
                score += same * stone[i+1][4];
                del(stone,4,i+1,same);
                onemore = true;
                same = 0;
            }
        }
    }while(onemore);
    return score;
}


int main() {
    int h;
    vector<int> toprow(5,0);//簡単のため最上段の上に0でうめた行を追加．
    cin>>h;
    while (h){
      vector<vector<int> > stones;
      stones.push_back(toprow);
      rep(i,h){
          vector<int> row(5);
          rep(j,5) {
              cin>>row[j];
          }
          stones.push_back(row);
      }
      cout<<soleve(stones,h)<<endl;
      cin>>h;
    }
    
    return 0;
}

C++: #include <iostream>
#include <map>
#include <vector>
#include <array>

using namespace std;


int clear(vector<array<int, 5>>& m)
{
    int sum = 0;
    auto e = m.end();
    for(auto& arr: m){
        int cnt = 1, v = arr[0], ip = 0;
        int maxcnt = 0, maxv = 0, maxi = 0;
        for(int i = 1; i < 5; ++i){
            cout << cnt << "," << v << endl;
            if(arr[i] == v)
                ++cnt;
            else{
                if(maxcnt < cnt){
                    maxcnt = cnt;
                    maxv = v;
                    maxi = ip;
                }
                v = arr[i];
                cnt = 1;
                ip = i;
            }
        }

        if(maxcnt < cnt){
            maxcnt = cnt;
            maxv = v;
            maxi = ip;
        }

        cout << "max: " << maxcnt << "," << maxv << "," << maxi << endl;

        if(maxcnt >= 3){
            for(int i = 0; i < maxcnt; ++i)
                arr[maxi + i] = 0;
            sum += maxv * maxcnt;
        }
    }
    cout << "sum: " << sum << endl;
    return sum;
}

void drop(vector<array<int, 5>>& m)
{
    if(m.size() < 2)
            return;
    for(int i = 0; i < 5; ++i){
        int idx = m.size() - 2;
        auto e = m.rend();
        int idx2 = m.size() - 1;
        for(auto s = m.rbegin(); s != e; ++s){
            if(idx > idx2)
                idx = idx2;
            auto& arr = *s;
            if(arr[i] == 0){
                while(m[idx][i] == 0 && idx != 0) { --idx; }

                arr[i] = m[idx][i];
                m[idx][i] = 0;

                if(idx == 0)
                    break;
            }

            --idx2;
        }
    }
}


int iter(vector<array<int, 5>>& m)
{
    int s = clear(m);
    drop(m);

    for(auto&e : m){
        for(auto& ee: e){
            cout << ee << ",";
        }
        cout << endl;
    }

    return s;
}




int main(void)
{
    int n;
    while(cin >> n){
        if(n == 0)
            break;

        vector<array<int, 5>> vec;
        for(int i = 0; i < n; ++ i){
            array<int, 5> arr;
            cin >> arr[0] >> arr[1] >> arr[2] >> arr[3] >> arr[4];
            vec.push_back(arr);
        }

        int l = 0;
        int s = 0;
        do{
            l = s;
            s += iter(vec);
        }while(l != s);

        cout << s << endl;
    }
}