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>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
typedef vector<int> vi;

int main(){
  int h;
  int g[11][11];

  while(cin >> h, h){
    rep(i,h)rep(j,5)cin >> g[i][j];

    int score = 0;
    bool flag = true;
    while(flag){
      flag = false;
      rep(i,h){
	int len = 0, prv = -1, col = -1;
	rep(j,5){
	  if(col==g[i][j] && g[i][j]!=-1){
	    len++;
	  }else{
	    if(len>=3){
	      flag = true;
	      for(int k=prv;k<prv+len;k++){
		score += g[i][k];
		g[i][k] = -1;
	      }
	    }
	    len=1;
	    prv = j;
	    col = g[i][j];
	  }
	}
	if(len>=3){
	  flag = true;
	  for(int k=prv;k<prv+len;k++){
	    score += g[i][k];
	    g[i][k] = -1;
	  }
	}
      }
      
      rep(j,5){
	for(int i=h-1;i>=1;i--){
	  for(int tmp=0;tmp<10 && (g[i][j]==-1);tmp++){
	    for(int k=i;k>=1;k--)swap(g[k][j],g[k-1][j]);
	  }
	}
      }
    }
    cout << score << endl;
  }
}

C++: #define rep(v, s, e) for(int v=(s);v<(e);v++)
#define res(v, s, e) for(int v=(s);(e)<=v;v--)
#include <algorithm>
#include <array>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using Line = array<char, 5>;
using Puzzle = vector<Line>;

void newline() {cout << endl;}
template <typename T>
void put(T input){cout << input;}
template <typename T>
void putl(T input){put(input); newline();}

int n;
int point;
Puzzle puzzle;

void swap_rec(int column, int row){
  if(0<column){
    swap(puzzle[column][row], puzzle[column-1][row]);
    swap_rec(column-1, row);
  }
}

void drop(){
  Puzzle prev_puzzle = puzzle;
  res(column, puzzle.size()-1, 0)
    res(row, puzzle[column].size()-1, 0)
      if(puzzle[column][row] == '#'){
        swap_rec(column, row);break;break;}
  if(puzzle != prev_puzzle) drop();
}

int clear(Line &line, int n, char c){
  if(line[n] == c){
    line[n]='#';
    if(1 <= n && n < line.size()-1){
      return int(c)-int('0')+clear(line, n+1, c)+clear(line, n-1, c);
    }else{
      return int(c)-int('0');
    }
  }
  return 0; 
}


int solve(){
  Puzzle prev_puzzle = puzzle;
  for(Line &line: puzzle)
    rep(k, 1, line.size()-1)
      if(line[k] != '#' && line[k-1] == line[k] && line[k] == line[k+1])
        point+=clear(line, k, line[k]);
  drop();
  if(prev_puzzle != puzzle) solve();
  return point;
}

int main() {
  while(cin>>n && n){
    point=0; puzzle={}; puzzle.reserve(n);
    rep(ic, 0, n){
      Line line;
      rep(lc, 0, line.size()){
        char s; cin >> s; line[lc]=s;
      }
      puzzle.push_back(line);
    }
    putl(solve());
  }
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#include<sstream>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define ALL(c) (c).begin(), (c).end()
#define dump(a) cerr << #a << "=" << (a) << endl
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class T> void chmin(T &t, T f) { if (t > f) t = f; } //t=min
template<class T> void chmax(T &t, T f) { if (t < f) t = f; } //t=max
using namespace std;


int N;
int puzzle[5][11];

int deletePuzzle()
{
	int get_p = 0;

	/*
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	cout << endl;
	*/

	rep(y,N) {
		int back_p = 0;
		int hit_cnt = 1;
		int real_hit_cnt = 0;
		int the_p = 0;

		//一致している要素を見つける
		rep(x,5) {
			if (puzzle[x][y] == back_p && puzzle[x][y] > 0) {
				hit_cnt++;
				if (hit_cnt >= 3) { //3回以上
					the_p = puzzle[x][y];
					real_hit_cnt = hit_cnt;
				}
			}
			else {
				hit_cnt = 1;
			}
			back_p = puzzle[x][y];
		}

		if (real_hit_cnt >= 3) { get_p += the_p * real_hit_cnt; } //ポイント換算
		//消去
		rep(x,5) {
			if (puzzle[x][y] == the_p) { puzzle[x][y] = 0; }
		}
	}

	/*
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	cout << endl;
	*/


	return get_p;
}

void dropPuzzle()
{
	rep(x,5) {
		vector<int> real_ps;
		rep(y,N) {
			if (puzzle[x][y] > 0) { real_ps.push_back(puzzle[x][y]); } //点数を吸い取る
			puzzle[x][y] = 0; //全部一回削除
		}
		int the_N = real_ps.size();
		rep(y,the_N) { //the_N分たどる
			puzzle[x][y+(N-the_N)] = real_ps[y];
		}
	}
	
	//デバッグ
	/*
	rep(y,N) {
		rep(x,5) { 
			cout << puzzle[x][y] << " ";
		}
		cout << endl;
	}
	*/
}

int main()
{
	int all_p;
	while(true) {
		cin >> N;
		all_p = 0;

		if (N == 0) { break; }
		rep(y,11) {
			rep(x,5) {
				puzzle[x][y] = 0;
			}
		}

		rep(y,N) {
			rep(x,5) {
				cin >> puzzle[x][y];
			}
		}

		/*
		rep(y,N) {
			rep(x,5) {
				cout << puzzle[x][y];
			}
			cout << endl;
		}
		cout << endl;
		*/

		//while get_p=0まで
		while(true) {
			int get_p = deletePuzzle();
			if (get_p == 0) { break; }
			all_p += get_p;
			dropPuzzle();
			//cout << endl;
		}

		cout << all_p << endl;
		//cout << endl;
	}
	return 0;
}