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 P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define pri(a) cout << (a) << endl
vector< vector<ll> > paz;
vector< vector<ll> > pazp;
ll score,N;
void pazdrop(){
	pazp = paz;
	paz = vector<vector<ll>>(N,vector<ll>(5, 0));
	FOR(i,0,5){
		ll k = N-1;
		FORR(j,0,N){
			if(pazp[j][i]!=0){
				paz[k][i] = pazp[j][i];
				k--;
			}
		}
	}
}
bool pazclear(){
	bool c = false;
	FOR(i,0,N){
		ll n = paz[i][0];
		ll k = 0;
		FOR(j,0,5){
			if(paz[i][j]==n){
				k++;
			}else{
				if(k>2&&n!=0){
					c = true;
					FOR(l,1,k+1){
						score+=paz[i][j-l];
						paz[i][j-l]=0;
					}	
				}
				k = 1;
				n = paz[i][j];
			}
		}
		if(k>2&&n!=0){
			c = true;
			FOR(l,1,k+1){
				score+=paz[i][5-l];
				paz[i][5-l]=0;
			}
		}
	}
	if(c)pazdrop();
	return c;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin>>N){
		if(N==0)break;
		score = 0;
		paz =  vector< vector<ll> >(N,vector<ll>(5, 0));
		FOR(i,0,N){
			FOR(j,0,5){
				cin >> paz[i][j];
			}
		}
		while(pazclear());
		cout << score << endl;
	}
}

C++: #define _USE_MATH_DEFINES
#include <cmath>
#include <string>
#include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <numeric>
#include <array>
#include <float.h>
#include <memory>
#include <functional>
#include <iomanip>
#include <queue>
#include <random>
#include <map>
#include <set>

#pragma warning(disable:4996)

using namespace std;

int table[15][5] = { 0 };

int DeletePiece(int H) {
  int score = 0;
  for (int y = 0; y < H; ++y) {
    vector<pair<int, int>> chain;
    chain.push_back({ 0,0 });
    int index = 0;
    for (int x = 1; x < 5; ++x) {
      if (table[y][x - 1] == table[y][x]) {
        ++chain[index].first;
        chain[index].second = table[y][x];
      }
      else{
        chain.push_back({ 0,table[y][x] });
        ++index;
      }
    }
    auto it = max_element(chain.begin(), chain.end(), [](auto& pair_1, auto& pair_2) {return pair_1.first < pair_2.first; });
    if (it->first >= 2 && it->second!=0) {
      for (int x = 0; x < 5; ++x) {
        if (table[y][x] == it->second) {
          table[y][x] = -1;
          score += it->second;
        }
      }
    }
  }
  return score;
}

void ReplacePiece(int H) {
  for (int y = H - 1; y >= 0; --y) {
    for (int x = 0; x < 5; ++x) {
      while (table[y][x] == -1) {
        for (int yy = y; yy > 0; --yy) {
          table[yy][x] = table[yy - 1][x];
        }
        table[0][x] = 0;
      }
    }
  }
}

int main() {
  while (true) {
    int H;
    int score = 0, tmp_score = 0;
    cin >> H;
    if (H == 0) {
      break;
    }
    for (int y = 0; y < H; ++y) {
      for (int x = 0; x < 5; ++x) {
        cin >> table[y][x];
      }
    }
    do {
      tmp_score = DeletePiece(H);
      score += tmp_score;
      ReplacePiece(H);
    } while (tmp_score != 0);
    cout << score << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int H, pzl[10][5];

int delStone()
{
  int ret = 0;
  
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5 - 2; j++){
      int *a = &pzl[i][j], *b = &pzl[i][j+1], *c = &pzl[i][j+2];
      if(abs(*a) == abs(*b) && abs(*a) == abs(*c)){
	*a = *b = *c = -abs(*a);
      }
    }
  }/*
    cout << "-------------------" << endl;
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5; j++) cout << pzl[i][j] << " ";
    cout << endl;
  }
   */
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5; j++){
      if(pzl[i][j] < 0){
	ret -= pzl[i][j];
	pzl[i][j] = 0;
      }
    }
  }/*
  cout << "-------------------" << endl;
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5; j++) cout << pzl[i][j] << " ";
    cout << endl;
  }
   */
  for(int i = H-1; i > 0; i--){
    for(int j = 0; j < 5; j++){
      if(pzl[i][j] == 0){
	for(int k = i-1; k >= 0 && pzl[i][j] == 0; k--){
	  swap(pzl[i][j], pzl[k][j]);
	}
      }
    }
  }/*
  cout << "-------------------" << endl;
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5; j++) cout << pzl[i][j] << " ";
    cout << endl;
  }
   */
  return ret;
}

int getScore()
{
  int ret = 0, rec = 0;
  while((rec = delStone()) > 0){
    ret += rec;
  }
  return ret;
}

int main()
{
  while(cin >> H, H){
    for(int i = 0; i < H; i++){
      for(int j = 0; j < 5; j++) cin >> pzl[i][j];
    }
    cout << getScore() << endl;
  }
  return 0;
}