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 <iostream>
#include <vector>
#include <queue>

using namespace std;
bool check[4][4];
int ban[20][5];
int H;
bool flag;
int score;

/*
bool calc() {
  int start, end;
  bool flag = false;
  for(int i = 0; i < H; i++) {
    int len = 1;
    int prev = 0;
    int digit = 0;
    for(int j = 0; j < 5; j++) {
      if(prev == ban[i][j] && ban[i][j] != 0){
        if(len == 3) {
          start = j - 3;
          digit = ban[i][j];
        }
        len++;

      }else {
        if(len >= 3) end = j - 1;
        prev = ban[i][j];
        len = 1;
      }
    }
    if(prev == ban[i][4] && len >= 3){
      end = 4;
    }
    cout << digit << endl;
    if(digit != 0){
      flag = true;
      for(int j = 0; j < 5; j++) {
        if(j >= start && j <= end) ban[i][j] = 0;
      }
      score += (end - start + 1) * digit;
    }
  }
  return flag;
}
*/

  
bool calc()
{
  bool flag = false;
  for ( int i = 0; i < H; ++i ) {
    bool h[4][4] = {false};
    for ( int j = 0;j < 4; ++j ) {
      h[0][j] = (ban[i][j] != 0) &&(ban[i][j] == ban[i][j + 1]);
    }

    for ( int j = 1; j < 4; ++j ) {
      for ( int k = 0; k < 4 - j; ++k ) {
        h[j][k] = h[j - 1][k] && (h[j - 1][k] == h[j - 1][k + 1]);
      }
    }

    for ( int j = 3;j >=1; --j ) {
      for ( int k = 0; k < 4 - j; ++k ) {
        if ( h[j][k] == true )
          {
            for ( int l = 0; l < j + 2; ++l ) {
              score += ban[i][l + k];
              ban[i][l + k] = 0;
            }
            flag = true;
            goto END;
          }
      }
    }
  END:;

  }
  return flag;
}



void koushin() {
  queue<int> que;
  for(int i = 0; i < 5; i++) {
    for(int j = H - 1; j >= 0; j--) {
      if(ban[j][i] == 0) continue;
      que.push(ban[j][i]);
    }
    
    for(int j = H - 1; j >= 0; j--) {
      if(que.empty()) ban[j][i] = 0;
      else {
        ban[j][i] = que.front(); que.pop();
      }
    }
  }
}

void printban() {
  for(int i = 0; i < H; i++) {
    for(int j = 0; j < 5 ;j++) {
      cout << " " << ban[i][j];
    }
    cout << endl;
  }
  cout << endl;
}

int main() {
  while(cin >> H && H != 0) {
    score = 0;
    for(int i = 0; i < H; i++) {
      for(int j = 0; j < 5; j++) {
        cin >> ban[i][j];
      }
    }
    while(true) { 
      if(calc() == false){
        // printban();
        break;
      }
      else {
        koushin();
        // printban();
      }
    }
    for(int i = 0; i < H; i++) {
      for(int j = 0; j < 5; j++) {
        ban[i][j] = 0;
      }
    }
    
    cout << score << endl;
  }
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include <iterator>
#include<queue>
#include <functional>
#include <string>
#include <numeric>
using namespace std;

int DelCheck(vector<int> &Line, bool &flag){
  int a = 0, score = 0;
  if (Line[2] == 0)return 0;
  if (Line[a] == Line[a + 1]){
    if (Line[a + 1] == Line[a + 2]){
      if (Line[a + 2] == Line[a + 3]){
        if (Line[a + 3] == Line[a + 4]){
          score = accumulate(Line.begin(), Line.end(), 0);
          fill(Line.begin(), Line.end(), 0);
          flag = true;
          return score;
        }
        else{
          score = accumulate(Line.begin(), Line.end() - 1, 0);
          fill(Line.begin(), Line.end() - 1, 0);
          flag = true;
          return score;
        }
      }
      else{
        score = accumulate(Line.begin(), Line.end() - 2, 0);
        fill(Line.begin(), Line.end() - 2, 0);
        flag = true;
        return score;
      }
    }
  }
  if (Line[a + 1] == Line[a + 2]){
    if (Line[a + 2] == Line[a + 3]){
      if (Line[a + 3] == Line[a + 4]){
        score = accumulate(Line.begin() + 1, Line.end(), 0);
        fill(Line.begin() + 1, Line.end(), 0);
        flag = true;
        return score;
      }
      else{
        score = accumulate(Line.begin() + 1, Line.end() - 1, 0);
        fill(Line.begin() + 1, Line.end() - 1, 0);
        flag = true;
        return score;
      }
    }
  }
  if (Line[a + 2] == Line[a + 3]){
    if (Line[a + 3] == Line[a + 4]){
      score = accumulate(Line.begin() + 2, Line.end(), 0);
      fill(Line.begin() + 2, Line.end(), 0);
      flag = true;
      return score;
    }
  }
  return 0;
  
}

int main(){
  while (1){
    int n;
    int Total=0;
    cin >> n;
    if (!n)return 0;
    vector<vector<int>> Field(n);
    for (int i = 0; i < n; ++i){
      
      int a, b, c, d, e;
      cin >> a >> b >> c >> d >> e;
      Field[i].push_back(a); Field[i].push_back(b);
      Field[i].push_back(c); Field[i].push_back(d);
      Field[i].push_back(e);
    }
    bool flag = true;
    while (flag){
      flag = false;
      for (int i = 0; i < n; ++i){
        Total += DelCheck(Field[i],flag);
      }
      for (int i = n-1; i >=0; --i){
        for (int j = 0; j < 5; ++j){
          for (int l = 0; l < n-1+1; ++l){
            if (Field[i][j] == 0){
              for (int k = i; k >0; --k){
                Field[k][j] = Field[k-1][j];
                Field[k - 1][j] = 0;
              }
            }
          }
        }
      }
    }
    cout << Total << endl;
  }
  return 0;
}