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++: ///
// File:  1193.cpp
// Author: ymiyamoto
//
// Created on Sat Nov 25 23:05:51 2017
//

#include <array>
#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;

void print_board(vector<vector<int32_t>> board)
{
  for (uint32_t i = 0; i < board.size(); i++) {
    for (uint32_t j = 0; j < board[i].size(); j++) {
      cout << board[i][j] << " ";
    }
    cout << endl;
  }
}

void erase(vector<vector<int32_t>> &board, vector<pair<uint32_t, uint32_t>> disps)
{
  for (uint32_t i = 0; i < disps.size(); i++) {
    for (uint32_t j = disps[i].first; j < disps[i].second; j++) {
      board[i][j] = -1;
    }
  }

  for (uint32_t i = 0; i < 5; i++) {
    for (uint32_t j = 0; j < board.size() - 1; j++) {
      while (board[j][i] == -1) {
        for (uint32_t k = j; k < board.size() - 1; k++) {
          board[k][i] = board[k + 1][i];
        }
      }
    }
  }
}

int32_t main()
{
  while (true) {
    int32_t H;
    cin >> H;
    if (H == 0) break;
    vector<vector<int32_t>> board(H + 1);
    for (int32_t i = H; i >= 0; i--) {
      for (uint32_t j = 0; j < 5; j++) {
        uint32_t b;
        if (i == H) {
          b = 0;
        } else {
          cin >> b;
        }
        board[i].push_back(b);
      }
    }

    uint32_t points = 0;
    while (true) {
      vector<pair<uint32_t, uint32_t>> disps(H);
      bool is_erase = false;
      for (uint32_t i = 0; i < H; i++) {
        uint32_t max_rep = 0;
        uint32_t start = 0;
        uint32_t end = 0;
        uint32_t max_start = 0;
        uint32_t max_end = 0;
        for (uint32_t j = 0; j < 5; j++) {
          if (board[i][j] != 0 && board[i][start] == board[i][j]) {
            end++;
            uint32_t rep = end - start;
            if (max_rep < rep) {
              max_rep = rep;
              max_start = start;
              max_end = end;
            }
          } else {
            start = j;
            end = j + 1;
          }
        }

        if (max_rep >= 3) {
          disps[i] = {max_start, max_end};
          points += board[i][max_start] * max_rep;
          is_erase = true;
        }
      }

      if (!is_erase) break;

      erase(board, disps);
    }

    cout << points << endl;
  }
  return 0;
}

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

#define rep(i,n) for(int i=0,i##_cond=(n);i<i##_cond;++i)
#define FOR(i,a,b) for(int i=(a),i##_cond=(b);i<i##_cond;++i)

int main(){
  while(1){
    int h; cin >> h; if(h == 0) break;
    
    vector<deque<int>> stone(5, deque<int>(h));
    rep(j, h) rep(i, 5) cin >> stone[i][j]; // j = 0が天井, h-1が底
    
    int ans = 0;
    while(1){
      int tmp = ans;
      rep(j, h){ // 上から見る
	int l = 0, r = 1; // [l, r) : 同じ数字が並ぶ区間
	rep(i,4){
	  if(stone[i][j] == stone[i+1][j]){
	    r++;
	  }else{
	    if(r - l >= 3) break;
	    l = i + 1;
	    r = i + 2;
	  }
	}
	
	if(stone[l][j] != -1 and r - l >= 3){
	  FOR(i, l, r){
	    ans += stone[i][j];
	    stone[i].erase(stone[i].begin() + j); // 消して
	    stone[i].push_front(-1); // 上に詰める
	  }
	}
      }
      if(tmp == ans) break;
    }
    cout << ans << endl;
  }
}