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"
typedef long long ll;
#define int ll
#define rep(i,n) for(int i = 0;i < (n) ; i++) 
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
using namespace std;
int MOD = 1000000007;

signed main(){

    int ban[10][5] = {0};
    int h;
    while(1){
        cin >> h;
        // cerr << 1  << endl;
        if(h == 0)break;
        int score = 0;
        for(int i = h-1;i >= 0;i--){
            for(int j = 0;j<5;j++){
                cin >> ban[i][j];
            }
        }
        // cerr << 2  << endl;
        while(1){
            int update = 0;
            for(int i = 0;i < h;i++){
                int era[5] = {0};
                if(ban[i][0] == ban[i][1] && ban[i][1] == ban[i][2] && ban[i][2] != 0){
                    era[0] = era[1] = era[2] = 1;
                    update = 1;
                }
                if(ban[i][1] == ban[i][2] && ban[i][2] == ban[i][3] && ban[i][2] != 0){
                    era[3] = era[1] = era[2] = 1;
                    update = 1;
                }
                if(ban[i][3] == ban[i][4] && ban[i][2] == ban[i][3] && ban[i][2] != 0){
                    era[4] = era[3] = era[2] = 1;
                    update = 1;
                }
                for(int j = 0;j < 5;j++){
                    if(era[j]){
                        score += ban[i][j];
                        ban[i][j] = 0;
                    }
                }
            }
            for(int i = 1;i < h;i++){
                rep(j,5){
                    int x = i;
                    while(1){
                        if(x == 0 || ban[x][j] == 0 || ban[x-1][j] != 0)break;
                        ban[x-1][j] = ban[x][j];
                        ban[x][j] = 0;
                        x--;
                    }
                }
            }
            if(update == 0)break;
        }
        cout << score << endl;
    }
    return 0;
}

// g++ -std=c++14 icpc2014_a.cpp
// rm -r -f test;oj dl https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_a
// rm -r -f test;oj dl http://agc034.contest.atcoder.jp/tasks/agc034_b

C++: #include <iostream>
#include <vector>

using namespace std;

int main() {
	int h;
	while (cin >> h) {
		if (h == 0) {
			break;
		}
		vector< vector<int> > data(h, vector<int>(5));
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> data[i][j];
			}
		}
		int point = 0;
		while (true) {
			vector< vector<int> > prev = data;
			int ans = 0;
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 3; j++) {
					if (data[i][j] == data[i][j + 1] && data[i][j] == data[i][j + 2]) {
						if (j < 2 && data[i][j] == data[i][j + 3]) {
							if (j < 1 && data[i][j] == data[i][j + 4]) {
								ans += data[i][j] * 5;
								data[i][j] = data[i][j + 1] = data[i][j + 2] = data[i][j + 3] = data[i][j + 4] = 0;
								continue;
							}
							ans += data[i][j] * 4;
							data[i][j] = data[i][j + 1] = data[i][j + 2] = data[i][j + 3] = 0;
							continue;
						}
						ans += data[i][j] * 3;
						data[i][j] = data[i][j + 1] = data[i][j + 2] = 0;
						break;
					}
				}
			}
			for (int j = 0; j < 5; j++) {
				for (int i = h-1; i >=0; i--) {
					if (data[i][j] == 0) {
						for (int k = i -1; k >= 0; k--) {
							if (data[k][j] != 0) {
								data[i][j] = data[k][j];
								data[k][j] = 0;
								break;
							}
						}
					}
				}
			}
			point += ans;
			if (data == prev) {
				break;
			}
		}
		cout << point << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;

int update(vector<vector<int> > &grid, vector<vector<bool> > &del){
  int h = grid.size();
  int res = 0;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < 5; j++) {
      if(del[i][j]){
        res += grid[i][j];
      }
    }
  }
  for (int i = 0; i < 5; i++) {
    int drop = 0;
    for (int j = h - 1; j >= 0; j--) {
      if(del[j][i] == true){
        drop++; 
      }else{
        grid[j + drop][i] = grid[j][i];
      }
    }
    for (int j = 0; j < drop; j++) {
      grid[j][i] = -1;
    }
  }
  // for (int i = 0; i < h; i++) {
  //   for (int j = 0; j < 5; j++) {
  //     std::cout << grid[i][j];
  //   }
  //   std::cout << std::endl;
  // }
  //   std::cout << std::endl;
  //   std::cout << std::endl;
  return res;
}

int main(){
  int h;
  while(std::cin >> h, h){
    int ans = 0;
    vector<vector<int> > grid(h, vector<int>(5));
    for (int i = 0; i < h; i++) 
      for (int j = 0; j < 5; j++) 
        std::cin >> grid[i][j];
    bool flag = true;
    while(flag){
      vector<vector<bool> > del(h, vector<bool>(5, false));
      flag = false;
      for (int i = 0; i < h; i++) {
      int cnt = 0;
        for (int j = 0; j < 4; j++) {
          if(grid[i][j] == grid[i][j + 1] and grid[i][j] >= 0){
            cnt++; 
          }else{
            if(cnt >= 2){
              flag = true;
              for (int k = 0; k <= cnt; k++)del[i][j - k] = true;
            }
            cnt = 0; 
          }
        }
        if(cnt >= 2){
          flag = true;
          for (int k = 0; k <= cnt; k++)del[i][4 - k] = true; 
        }
      }
      ans += update(grid, del);
    }
    std::cout << ans << std::endl;
  }
  return 0;
}