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 _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>

using namespace std;
int grid[10][5];
int tmp_col[10];
/*
void show(int H){
  for(int i = 0; i < H; i++){
    for(int j = 0; j < 5; j++){
      cout << grid[i][j];
    }
    cout << endl;
  }
  return;
}
*/
int main(void){
  while(true){
    int H;
    cin >> H;
    if(H == 0){
      break;
    }
    for(int i = 0; i < H; i++){
      for(int j = 0; j < 5; j++){
        cin >> grid[H - i - 1][j];
      }
    }
    int score = 0;
    while(true){
      bool updated = false;
      for(int i = 0; i < H; i++){
        int range_begin = -1;
        int range_color = -1;
        for(int j = 0; j < 5; j++){
          if(range_color != grid[i][j]){
            if(j - range_begin >= 3 && range_color > 0){
              updated = true;
              for(int k = range_begin; k < j; k++){
                score += grid[i][k];
                grid[i][k] = 0;
              }
            }
            range_begin = j;
            range_color = grid[i][j];
          }
        }
        if(5 - range_begin >= 3 && range_color > 0){
          updated = true;
          for(int k = range_begin; k < 5; k++){
            score += grid[i][k];
            grid[i][k] = 0;
          }
        }
      }
      if(!updated){
        break;
      }

      for(int i = 0; i < 5; i++){
        int real_height = 0;
        for(int j = 0; j < H; j++){
          if(grid[j][i] != 0){
            tmp_col[real_height] = grid[j][i];
            real_height ++;
          }
        }
        for(int j = 0; j < H; j++){
          grid[j][i] = 0;
        }
        for(int j = 0; j < real_height; j++){
          grid[j][i] = tmp_col[j];
        }
      }
    }
    cout << score << endl;
  }
  return 0;
}

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

int main() {
    int H;
    while(true) {
        scanf("%d", &H);
        if(H == 0) break;
        int p[10][5];
        for(int i = H - 1; i >= 0; --i) {
            for(int j = 0; j < 5; ++j) {
                scanf("%d", &p[i][j]);
            }
        }
        bool updated;
        int point = 0;
        while(true) {
            updated = false;
            for(int i = 0; i < H; ++i) {
                for(int j = 0; j < 5; ++j) {
                    if(p[i][j] == 0) continue;
                    int d = 1;
                    while(j + d < 5) {
                        if(p[i][j] != p[i][j + d]) break;
                        ++d;
                    }
                    if(d >= 3) {
                        updated = true;
                        point += d * p[i][j];
                        fill(p[i] + j, p[i] + j + d, 0);
                    }
                }
            }
            if(!updated) break;
            for(int _ = 0; _ < 5; ++_) {
                for(int i = 0; i < H - 1; ++i) {
                    for(int j = 0; j < 5; ++j) {
                        if(p[i][j] == 0) {
                            swap(p[i][j], p[i + 1][j]);
                        }
                    }
                }
            }
            printf("\n");
            for(int i = H - 1; i >= 0; --i) {
                for(int j = 0; j < 5; ++j) {
                    printf("%d ", p[i][j]);
                }
                printf("\n");
            }
        }
        printf("%d\n", point);
    }
    return 0;
}

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

int H;
int b[10][5];

struct range {
  int row;
  int left;
  int right;
};

void drop(int row, int col) {
  for (int i = row; i > 0; i--) {
    b[i][col] = b[i-1][col];
  }
  b[0][col] = -1;
}

void print_board() {
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < 5; j++) {
      cerr << b[i][j] << ' ';
    }
    cerr << endl;
  }
  cerr << endl;
}

void solve() {
  int ans = 0;
  while (1) {
    print_board();
    vector<range> deleted;
    for (int i = 0; i < H; i++) {
      int left = 0;
      for (int j = 1; j < 6; j++) {
        if (j == 5 || b[i][j] != b[i][j-1]) {
          if (j >= left + 3) {
            if (b[i][j-1] != -1) {
              range tmp = {i, left, j-1};
              deleted.push_back(tmp);
              ans += b[i][j-1] * (j - left);
            }
            break;
          } else {
            left = j;
          }
        }
      }
    }
    if (deleted.size() == 0) { break; }
    for (int k = 0; k < deleted.size(); k++) {
      range d = deleted[k];
      for (int j = d.left; j <= d.right; j++) {
        drop(d.row, j);
      }
    }
  }
  cout << ans << endl;
}

int main() {
  while (1) {
    cin >> H;
    if (H == 0) { break; }
    for (int i = 0; i < H; i++) {
      for (int j = 0; j < 5; j++) {
        cin >> b[i][j];
      }
    }
    solve();
  }
}