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 <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define REP2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define REP(i, n) REP2(i, 0, n)
#define ALL(S) (S).begin(), (S).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);

  int H;
  while (cin >> H && H){

    int board[H][5];
    REP(i, H){
      REP(j, 5) cin >> board[i][j];
    }


    int  score  = 0;
    bool update = true;

    
    while (update){
      update = false;
      int next_board[H][5];
      memcpy(next_board, board, sizeof(board));
      
      // REP(i, H){
      //   REP(j, 5) cout << board[i][j] << " " ;
      //   cout << endl;
      // }
      // cout << endl;

      REP(i, H) REP(r, 6) REP(l, r) if (r - l >= 3 && board[i][l] >= 0){
        bool same = true;
        int value = board[i][l];
        REP2(k, l, r) if (board[i][k] != value) same = false;
        
        REP2(k, l, r) if (same){
          next_board[i][k] = -1;
        }
      }
      
      REP(i, H) REP(j, 5) if (board[i][j] != next_board[i][j]){
        update = true;
      }

      if (update){
        REP(i, H) REP(j, 5){
          if (board[i][j] >= 0 && next_board[i][j] == -1){
            score += board[i][j];
          }
          board[i][j] = next_board[i][j];
        }
        
        bool has_drop = true;
        while (has_drop){
          has_drop = false;
          
          REP(i, H - 1) REP(j, 5) if (board[i + 1][j] == -1 && board[i][j] >= 0){
            has_drop = true;
            swap(board[i + 1][j], board[i][j]);
          }
        }
      }
    }
    cout << score << endl;
    
    
  }
  
  return 0;
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <cctype>
#include <complex>
#include <regex>

using namespace std;


int main() {

    while (true) {

        int H;
        cin >> H;

        if (H == 0) break;

        vector <vector<int>> S(H, vector<int>(5));
        for (int i = 0; i < H; i++) for (int j = 0; j < 5; j++) cin >> S[i][j];

        int score = 0;

        while (true) {
            bool finish = true;

            //終了か確認
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < 3; j++) {
                    bool good = true;
                    int color = S[i][j];
                    if (color == 0) continue;
                    for (int k = 0; k < 3; k++) if (color != S[i][j + k]) good = false;
                    if (good) finish = false;
                }
            }

            if (finish) break;

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < 3; j++) {
                    int count = 0;
                    int color = S[i][j];
                    int index = 0;
                    while ((j + index) < 5 && S[i][j + index] == color) count++, index++;
                    if (count >= 3) {
                        for (int k = 0; k < count; k++) {
                            score += S[i][j + k];
                            S[i][j + k] = 0;
                        }
                    }
                }
            }

            vector <vector<int>> newS(H, vector<int>(5, 0));
            for (int i = 0; i < 5; i++) {
                int index = H - 1;
                for (int j = H - 1; j >= 0; j--) {
                    if (S[j][i] != 0) {
                        newS[index][i] = S[j][i];
                        index--;
                    }
                }
            }

            S = newS;

        }

        cout << score << endl;

    }

    return 0;
}