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++: // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

void blockfall(vector< vector<int> > &board) {
    int H = board.size(), W = board[0].size();
    for(int i=H-1; i>=0; i--) {
        for(int j=0; j<W; j++) {
            if(board[i][j] == 0) continue;
            int r = i;
            while(r+1 < H and board[r+1][j] == 0) {
                swap(board[r+1][j], board[r][j]);
                r++;
            }
        }
    }
}

int disappear(vector< vector<int> > &board) {
    int H = board.size(), W = board[0].size();
    vector< vector<int> > checked(H, vector<int>(W));
    int ans = 0;
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            if(checked[i][j] or board[i][j] == 0) continue;
            int t = board[i][j], c = j, s = 0;
            while(c < W and board[i][c] == t) {
                s++; c++;
            }
            if(s < 3) continue;
            c = j;
            while(c < W and board[i][c] == t) {
                ans += t;
                board[i][c] = 0;
                c++;
            }
        }
    }
    return ans;
}

int solve_testcase() {
    int H; scanf("%d", &H);
    if(H == 0) return 1;

    const int W = 5;
    vector< vector<int> > board(H, vector<int>(W));
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            scanf("%d", &board[i][j]);
        }
    }

    int p, ans = 0;
    while(p = disappear(board), p > 0) {
        ans += p;
        blockfall(board);
    }
    printf("%d\n", ans);
    return 0;
}

int main() {
    while(!solve_testcase());
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#define EMPTY -1
using namespace std;

int main()
{
  int h;
  for(;;){
    scanf("%d",&h);
    if(h==0)return 0;
    int map[h][5];
    //????????????????????????
    for(int i=0;i<h;i++){for(int j=0;j<5;j++){scanf("%d",&map[i][j]);}}
    bool next = true;    //???????¶????????????£?????´???false??¨??????for???????????????
    int point = 0;   //????¨????????????????
    for(;;){
      if(!next)break;
      next = false;
      //???????¨????????????????
      for(int i=0;i<h;i++){  //???????????????????????????????????????(i)
	for(int j = 0;j<5;j++){  //??????????§???°???(j)
	  if(map[i][j]==EMPTY)continue;
	  int count = 1;  //??£?¶??????????????????°(count)
	  int k;  //????????°???(k)
	  for(k=j+1;k<5;k++){
	    if(k>=5)break;
	    if(map[i][j]!=map[i][k])break;
	    count++;
	  }
	  if(count>=3){   //??£?¶???????????????´???
	    next = true;    //?¶????????????????????????????for??????????????????
	    point+=map[i][j]*count;  //????????????
	    for(int l=0;l<count;l++){ //????????????
	      map[i][j+l]=EMPTY;
	    }
	    count=1;
	  }
	}
      }
      //????????????
      for(int i=0;i<5;i++){  //???????????????????????????????????????(i,0-5)
	for(int j=h-1;j>=0;j--){  //??\?????????????§???°???(j,(h-1)-0)
	  if(map[j][i]!=EMPTY)continue;
	  for(int k=(j-1);k>=0;k--){  //????§???°???????????????????¨?
	    if(k<0)break;
	    if(map[k][i]!=EMPTY){  //?????????????????£??????????§???°?????¨??\?????????
	      map[j][i]=map[k][i];
	      map[k][i]=EMPTY;
	      break;
	    }
	  }
	}
      } 
    }
    printf("%d\n",point);
  }
}