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

int ans = 0;
vector<vector<int>> board;

void input(int H)
{
  board.clear();
  board.resize(5, vector<int>(10, 0));
  for (int row = H - 1; row >= 0; row--)
  {
    rep(col, 5)
    {
      cin >> board.at(col).at(row);
    }
  }
}

pair<int, int> find(int row)
{
  int start = -1, last = -1, cnt = 0;
  rep(col, 5)
  {
    if (board.at(col).at(row) == 0)
    {
      start = -1;
      last = -1;
      cnt = 0;
      continue;
    }
    if (board.at(col).at(row) == last)
    {
      cnt++;
    }
    else
    {
      if (cnt >= 3)
      {
        break;
      }
      start = col;
      last = board.at(col).at(row);
      cnt = 1;
    }
  }
  return make_pair(start, cnt);
}

void change(pair<int, int> p, int row)
{
  int start, cnt;
  tie(start, cnt) = p;
  if (start == -1 || cnt < 3)
  {
    return;
  }
  ans += board.at(start).at(row) * cnt;
  for (int col = start; col < start + cnt; col++)
  {
    board.at(col).at(row) = -1;
  }
}

void update()
{
  rep(col, 5)
  {
    vector<int> new_col(10, 0);
    int index = 0;
    rep(i, 10)
    {
      if (board.at(col).at(i) == -1)
      {
        continue;
      }
      if (board.at(col).at(i) == 0)
      {
        break;
      }
      new_col.at(index) = board.at(col).at(i);
      index++;
    }
    board.at(col) = new_col;
  }
}

void solve()
{
  ans = 0;
  rep(i, 10)
  {
    rep(row, 10)
    {
      change(find(row), row);
    }
    update();
  }
  cout << ans << endl;
}

int main()
{
  while (1)
  {
    int H;
    cin >> H;
    if (!H)
      break;
    input(H);
    solve();
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }

class Solver {
  public:
    bool solve() {
        int H; cin >> H;
        if(H == 0) return false;
        vector<vector<int>> G(H, vector<int>(5)); cin >> G;
        int sum = 0;
        bool ok = true;
        auto clear = [&] (int h, int x, int seq) {
            sum += seq * G[h][x];
            rep(i, seq) G[h][x - i] = 0;
            ok = true;
        };
        while(ok) {
            ok = false;
            rep(h, H) {
                int prev = 0, seq = 0;
                rep(x, 5) {
                    if(prev > 0 and G[h][x] == prev) {
                        seq++;
                    } else {
                        if(seq >= 3) clear(h, x - 1, seq);
                        seq = 1;
                        prev = G[h][x];
                    }
                }
                if(seq >= 3) clear(h, 5 - 1, seq);
            }
            rep(x, 5) {
                int pos = H - 1; 
                for(int h = H - 1; h >= 0; h--) {
                    while(pos > h and G[pos][x] != 0) pos--;
                    if(G[pos][x] == 0) swap(G[pos][x], G[h][x]);
                }
            }
        }
        cout << sum << endl;
        return true;
    }
};

int main() {
    while(Solver().solve());
    return 0;
}