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 <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

using ll = long long;
using ull = uint64_t;
using P = pair<int, int>;
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    constexpr int W = 5;
    for(;;){
        int H;
        cin >> H;
        if(H == 0)  return 0;
        vector<vector<int>> Stone(H, vector<int>(W));
        for(int i = H - 1; i >= 0; --i){
            for(int j = 0; j < W; ++j){
                cin >> Stone[i][j];
            }
        }
        int ans = 0;
        bool update = true;
        while(update){
            update = false;
            for(int i = 0; i < H; ++i){
                for(int j = 0; j < W;){
                    int len = 1;
                    for(int k = j + 1; k < W; ++k){
                        if(Stone[i][k] == Stone[i][j])  ++len;
                        else    break;
                    }
                    if(Stone[i][j] == 0){
                        j += len;
                        continue;
                    }
                    if(len >= 3){
                        update = true;
                        ans += Stone[i][j] * len;
                        for(int k = 0; k < len; ++k)    Stone[i][j + k] = 0;
                    }
                    j += len;
                }
            }
            if(update){
                vector<int> idx(W, 0);
                for(int i = 0; i < H; ++i){
                    for(int j = 0; j < W; ++j){
                        if(Stone[i][j]){
                            if(idx[j] == i) ++idx[j];
                            else{
                                Stone[idx[j]++][j] = Stone[i][j];
                                Stone[i][j] = 0;
                            }
                        }
                    }
                }
            }
        }
        cout << ans << '\n';
    }
}

C++: /*
    Problem 92
    https://onlinejudge.u-aizu.ac.jp/problems/1193
*/
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
int H;
int W = 5;
vector<vector<int>> pazzle(MAX, vector<int>(W));
/* function */
void init() {
    for (int i = 0; i < MAX; i++) for (int j = 0; j < W; j++)
        pazzle[i][j] = 0;
}
void input() {
    for (int i = 0; i < H; i++) for (int j = 0; j < W; j++)
        cin >> pazzle[i][j];
}
int deleteStone() {
    int ret = 0;
    for (int h = 0; h < H; h++) {
        for (int l = 0; l < W;) {
            int r = l + 1;
            for (; r < W && pazzle[h][l] == pazzle[h][r]; r++);
            if (r - l >= 3) {
                ret += pazzle[h][l] * (r - l);
                for (; l < r; l++) pazzle[h][l] = 0;
            }
            l = r;
        }
    }
    return ret;
}
void moveStone() {
    for (int w = 0; w < W; w++) {
        vector<int> tmp(H, 0);
        int len = 0;
        for (int h = H-1; h >= 0; h--)
            if (pazzle[h][w] != 0) tmp[len++] = pazzle[h][w];
        for (int h = H-1; h >= 0; h--)
            pazzle[h][w] = tmp[H-1-h];
    }
}
void solve() {
    init();
    input();
    int totalScore = 0;
    while (1) {
        int score = deleteStone();
        if (score == 0) break;
        totalScore += score;
        moveStone();
    }
    cout << totalScore << '\n';
}
/* main */
int main(){
    while (1) {
        cin >> H;
        if (H == 0) return 0;
        solve();
    }
}