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++: #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;

#define int long long int

size_t main()
{
	int N;
	while (cin >> N, N)
	{
		vector<vector<int>>data;
		data.clear();
		data.resize(N);
		for (size_t i = 0; i < N; i++)
		{
			data[i].resize(5);
			for (size_t j = 0; j < 5; j++)
			{
				cin >> data[i][j];
			}
		}
		int ans = 0;
		bool f = 1;
		while (f)
		{
			f = 0;
			for (size_t i = 0; i < N; i++)
			{
				int a = data[i][0];
				int b;
				int count = 1;
				int count2 = 1;
				for (size_t j = 1; j < 5; j++)
				{
					if (data[i][j] == a&&data[i][j])
					{
						count++;
					} else
					{
						if (count2 < count)
						{
							count2 = count;
							b = a;
						}
						a = data[i][j];
						count = 1;
					}
				}
				if (count2 < count)
				{
					count2 = count;
					b = data[i][4];
				}
				if (count2 >= 3)
				{
					f = 1;
					ans += count2*b;
					for (size_t j = 0; j < 5; j++)
					{
						if (data[i][j] == b)
						{
							data[i][j] = 0;
						}
					}
				}
			}
			for (int i = N - 1; i >= 0; i--)
			{
				
				for (size_t j = 0; j < 5; j++)
				{
					if (data[i][j] == 0)
					{
						int k = i;
						while (k >= 0 && data[k][j] == 0)
						{
							k--;
						}
						if (k < 0)data[i][j] = 0;
						else
						{
							data[i][j] = data[k][j];
							data[k][j] = 0;
						}
					}
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;

int m[11][6];

bool downStone(int x, int y){
    if(m[y][x] == -1) return 0;
    if(m[y + 1][x] == -1){
        m[y + 1][x] = m[y][x];
        m[y][x] = -1;
        return 1;
    }
    return 0;
}

bool deleteLine(int x, int y){
    int c = m[y][x];
    if(c == -1) return 0;
    int cnt = 0;
    rep(i,5 - x){
        if(c == m[y][x + i]) cnt++;
        else break;
    }
    if(cnt >= 3){
        rep(i,cnt){
            m[y][x + i] = -1;
        }
        return 1;
    }
    return 0;
}

int main(){
    int n;
    while(cin >> n, n){
        map<int, int> p;
        rep(i,n){
            rep(j,5){
                cin >> m[i][j];
                p[m[i][j]]++;
            }
        }
        rep(j,1000){
            bool a;
            rep(i,n){
                rep(j,5){
                    deleteLine(j, i);
                }
            }
            while(1){
                if(n == 1) break;
                a = false;
                for(int i = n - 2; i >= 0; i--){
                    rep(j,5){
                        if(downStone(j, i)) a = true;
                    }
                }
                if(not a) break;
            }
        }
        rep(i,n){
            rep(j,5){
                if(m[i][j] != -1){
                    p[m[i][j]]--;
                }
            }
        }
        int sum = 0;
        for(auto it:p){
            sum+=it.first * it.second;
        }
        cout << sum << endl;
        //rep(i,n){ rep(j,5){ cout << m[i][j]; } cout << endl; }
    }
}