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 <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <set>

using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)
#define MEMSET(v, h) memset((v), h, sizeof(v))

const int w = 5;
int h;
int field[20][20];
bool del[20][20];
int main() {
  while (scanf("%d", &h) > 0 && h) {
    MEMSET(field, 0);
    REP(y, h) {
      REP(x, w) {
        scanf("%d", &field[y][x]);
      }
    }
    int ans = 0;
    REP(iter1, 100) {
      MEMSET(del, false);
      REP(y, h) {
        REP(x, w - 2) {
          if (field[y][x] == field[y][x + 1] && field[y][x] == field[y][x + 2]) {
            del[y][x] = del[y][x + 1] = del[y][x + 2] = true;
          }
        }
        REP(x, w) {
          if (!del[y][x]) { continue; }
          ans += field[y][x];
          field[y][x] = 0;
        }
      }
      REP(iter2, h) {
        for (int y =  h - 2; y >= 0; y--) {
          REP(x, w) {
            if (field[y + 1][x] == 0) { swap(field[y][x], field[y + 1][x]); }
          }
        }
      }
    }
    printf("%d\n", ans);
  }
}

C++: #include<bits/stdc++.h>
using namespace std;

// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()

// code starts
int main()
{
	int h;
  cin>>h;
  while(h!=0)
  {
    vector<vector<int>> board(h,vector<int>(5));
    int i,j,k;
    rep(i,h)rep(j,5)cin>>board[i][j];
    int score=0;
    bool update=true;
    while(update)
    {
      update=false;
      rep(i,h)
      {
        int base=board[i][2];
        if(base==0)continue;
        int count=0;
        int kc=0;
        int st=0;
        rep(j,5)
        {
          if(board[i][j]==base)
          {
            if(kc==0&&j<3)st=j;
            kc++;
            count=max(count,kc);
          }
          else
          {
            kc=0;
          }
        }
        if(count>=3)
        {
          update=true;
          score+=base*count;
          for(j=st;j<st+count;j++)if(board[i][j]==base)
          {
            board[i][j]=0;
          }
        }
      }
      rep(j,5)
      {
        for(i=h-1;i>=0;i--)
        {
          if(board[i][j]!=0)continue;
          for(k=i-1;k>=0;k--)
          {
            if(board[k][j]!=0)
            {
              swap(board[i][j],board[k][j]);
              break;
            }
          }
        }
      }
    }
    cout<<score<<endl;
    cin>>h;
  }
}

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) {
		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) {
				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 (N == 10) { dump(real_hit_cnt); }
		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; }
		}
	}

	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();
		//dump(N-the_N);
		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,N) {
			rep(x,5) {
				cin >> puzzle[x][y];
			}
		}

		//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;
}