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;

void solve(int h){
	int a[h][5];
	for(int i=0; i<h; ++i)
		for(int j=0; j<5; ++j)
			cin >> a[i][j];
	int ans = 0;
	while(1){
/*		for(int i=0; i<h; ++i)
			for(int j=0; j<5; ++j)
				cout << a[i][j] << (j==4?"\n":" ");
*/		bool f = false;
		for(int i=0; i<h; ++i){
			if(a[i][2] == 0) continue;
			int l = 0, r = 0;
			if(a[i][1] == a[i][2]){
				l = 1;
				if(a[i][0] == a[i][1])
					l = 2;
			}
			if(a[i][3] == a[i][2]){
				r = 1;
				if(a[i][4] == a[i][3])
					r = 2;
			}
			if(l+r+1 >= 3){
				ans += a[i][2] * (l+r+1);
				for(int j=0; j<r; ++j)
					a[i][2+j+1] = 0;
				for(int j=0; j<l; ++j)
					a[i][2-j-1] = 0;
				a[i][2] = 0;
				f = true;
			}
		}
		for(int i=0; i<5; ++i)
			for(int j=h-1; j>0; --j){
				int t = 0;
				while(j-t >= 0 && a[j-t][i] == 0) ++t;
				if(t > 0 && j-t >= 0){
					a[j][i] = a[j-t][i];
					a[j-t][i] = 0;
				}
			}
		if(!f) break;
	}
	cout << ans << "\n";
}

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	while(1){
		int h;
		cin >> h;
		if(h == 0) return 0;
		solve(h);
	}
}

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

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int h;
  while (cin >> h, h) {
    vector<vector<int>> a(5, vector<int>(2 * h));
    for (int i = h; i--; ) {
      for (int j = 0; j < 5; ++j) {
        cin >> a[j][i];
      }
    }
    int res = 0;
    while (true) {
      bool any = false;
      for (int i = h; i--; ) {
        if (a[2][i] == 0) {
          continue;
        }
        int l = 2, r = 2;
        while (l and a[l - 1][i] == a[2][i]) {
          --l;
        }
        while (r < 4 and a[r + 1][i] == a[2][i]) {
          ++r;
        }
        if (r - l >= 2) {
          any = true;
          res += a[2][i] * (r - l + 1);
          for (int j = l; j <= r; ++j) {
            a[j].erase(begin(a[j]) + i);
          }
        }
      }
      if (not any) {
        break;
      }
    }
    cout << res << '\n';
  }
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
 
using namespace std;

int delete_piece();

int puzzle[10][5];
int h;

int main()
{
    while(1){
        cin >> h;
        if(h == 0) break;
        for(int i = h - 1; i >= 0; i--){
            for(int j = 0; j < 5; j++){
                cin >> puzzle[i][j];
            }
        }
        int get_score = 0;
        int total_score = 0;
        while(1){
            get_score = delete_piece();
            if(get_score == 0) break;
            else total_score += get_score;
        }
        cout << total_score << endl;
    }
    return 0;
}

int delete_piece()
{
    int sum_score = 0;
    for(int i = h - 1; i >= 0; i--){
        int delete_start = 0;
        int delete_end = 0;
        for(int j = 0; j < 3; j++){
            if(puzzle[i][j] != 0 && puzzle[i][j] == puzzle[i][j + 1] && puzzle[i][j] == puzzle[i][j + 2]){
                delete_start = j;
                if(j == 0){
                    if(puzzle[i][j] == puzzle[i][j + 3]){
                        if(puzzle[i][j] == puzzle[i][j + 4]) delete_end = 5;
                        else delete_end = 4;
                    } else delete_end = 3;
                } else if(j == 1){
                    if(puzzle[i][j] == puzzle[i][j + 3]) delete_end = 4;
                    else delete_end = 3;
                } else delete_end = 3;
                break;
            }
        }
        if(delete_end == 0) continue;
        sum_score += puzzle[i][delete_start] * delete_end;
        for(int j = delete_start; j < delete_start + delete_end; j++){
            puzzle[i][j] = 0;
        }
    }
    if(sum_score == 0) return 0;
    for(int i = 0; i < h; i++){
        for(int j = 0; j < 5; j++){
            if(puzzle[i][j] == 0){
                if(i != h - 1){
                    for(int k = 1; i + k < h; k++){
                        if(puzzle[i + k][j] != 0){
                            puzzle[i][j] = puzzle[i + k][j];
                            puzzle[i + k][j] = 0;
                            break;
                        }
                    }
                } else puzzle[i][j] = 0;
            }
        }
    }
    return sum_score;
}