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 <algorithm>
using namespace std;

int main()
{
  while(1){
    int H;
    cin >> H;
    if(H == 0) break;
    int p[H][5];
    int ans = 0;
    for(int i = 0; i < H; i++)
      for(int j = 0; j < 5; j++)
        cin >> p[i][j];
    bool flag = true;
    while(flag){
      flag = false;
      for(int i = 0; i < H; i++){
        int x = p[i][2];
        int n  = count(&p[i][0], &p[i + 1][0], x);
        if(x == -1) continue;
        if(n == 3){
          if(p[i][0] == x && p[i][1] == x){
            flag = true;
            ans += 3 * x;
            for(int j = 0; j < 3; j++)
              p[i][j] = -1;
          }else if(p[i][3] == x && p[i][4] == x){
            flag = true;
            ans += 3 * x;
            for(int j = 2; j < 5; j++)
              p[i][j] = -1;
          }else if(p[i][1] == x && p[i][3] == x){
            flag = true;
            ans += 3 * x;
            for(int j = 1; j < 4; j++)
              p[i][j] = -1;
          }
        }else if(n == 4){
          flag = true;
          ans += 4 * x;
          if(p[i][0] == x){
            for(int j = 0; j < 4; j++)
              p[i][j] = -1;
          }else{
            for(int j = 1; j < 5; j++)
              p[i][j] = -1;
          } 
        }else if(n == 5){
          flag = true;
          ans += 5 * x;
          for(int j = 0; j < 5; j++)
            p[i][j] = -1;
        }
      } 
      for(int j = H - 1; j >= 0; j--){
        for(int k = 0; k < 5; k++){
          if(p[j][k] == -1){
            for(int l = j - 1; l >= 0; l--){
              if(p[l][k] != -1){
                swap(p[j][k], p[l][k]);
                break;
              }
            }
          }
        }
      }
    }
    cout << ans << endl;
  }
}

C++: #include <iostream>
#include <stdlib.h>

using namespace std;

int main()
{
  while (true) {
  int h;
  cin >> h;
  if (h == 0) break;
  int array[h][5];
  int sco = 0;
  
  for (size_t i = 0; i < h; i++)
    for (size_t j = 0; j < 5; j++)
      cin >> array[i][j];

  int num;
  for (size_t t = 0; t < 5; t++) {
  //while (true) {
    for (size_t i = 0; i < h; i++) {
      int tmp = array[i][0];
      int count = 0;
      num = 0;
      for (size_t j = 0; j < 5; j++) {
	if (tmp == array[i][j]) {
	  count++;
	  num = tmp;
	} else if (count < 3) {
	  tmp = array[i][j];
	  count = 1;
	  num = 0;
	}
      }
      if (count > 2 && num > 0) {
	for (size_t j = 0; j < 5; j++)
	  if(num == array[i][j])
	    array[i][j] = 0;
	//cout << "num::" << num << endl;
	//cout << "count::" << count << endl;
	  sco += num*count;
      }
    }
    bool flag = true;
    for (size_t i = 0; i < h; i++)
      for (size_t j = 0; j < 5; j++)
	if (array[i][j] == 0)
	  flag = false;

    if (flag) break;
    
    /*
    for (size_t i = 0; i < h; i++) {
      for (size_t j = 0; j < 5; j++)
	cout << array[i][j] << " ";
      cout << endl;
    } cout << endl;
    */
    
  for (int k = h-1; k > 0; k--) {
    for (size_t i = 0; i < 5; ) {
      if (array[k][i] == 0) {
	int nzc=0;
	for (int j = k; j >= 0; --j) {
	  if (array[j][i] != 0)
	    nzc++;
	}
	if (nzc != 0) {
	  for (int j = k; j > 0; j--) {
	    array[j][i] = array[j-1][i];	  
	}
	  array[0][i] = 0;
	}
	else
	  i++;
      }
      else
	i++;
    }
  }

   for (size_t i = 0; i < h; i++) 
    for (size_t j = 0; j < 5; j++)
      if (array[i][j] == 0)
	array[i][j] = -1;
     
  
   /*
  for (size_t i = 0; i < h; i++) {
    for (size_t j = 0; j < 5; j++)
      cout << array[i][j] << " ";
    cout << endl;
  } cout << endl;
   */
  
  }
  
  cout << sco << endl;
  }
  return 0;
  
}

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

long long int solutions;
bool grandFlag;

void print(vector<vector<int> >& pz){
  for(int i=0; i<pz.size(); i++){
    for(int j=0; j<5; j++)
      cout << pz[i][j] << " ";
    cout << endl;
  }
};

void solve(vector<vector<int> >& pz){
  for(int i=pz.size()-1; i>=0; i--){
    int a = pz[i][0], x = 1, pos = 0;
    bool yes = false;
    for(int j=1; j<5; j++){
      if(pz[i][j] == a && a!=0)
	x++;
      else if(x>=3) {
	yes = true;
	pos = j-1;
	break;
      }
      else{
	x = 1;
	a = pz[i][j];
      }
      if(j == 4 && x>=3){
	yes = true;
	pos = j;
      }
    }
    if(yes == 1){
      for(int j=pos; j>pos-x; j--)
	pz[i][j] = 0;
      solutions += (a*x);
      grandFlag = true;
    }
  }
};

void simplify(vector<vector<int> >& pz){
  int lowest; bool set;
  for(int j=0; j<5; j++){
    lowest = pz.size();
    set = false;
    for(int i=pz.size()-1; i>=0; i--){
      if(pz[i][j] == 0 && !set){
	lowest = i;
	set = true;
      }
      else if(pz[i][j] != 0 && set){
	swap(pz[i][j], pz[lowest][j]);
	lowest--;
      }
    }
  }
};

void slv(vector<vector<int> >& pz){
  while(grandFlag){
    grandFlag = false;
    solve(pz);
    simplify(pz);
  }
};

int main(){
  int h;
  cin >> h;
  while(h!=0){
    solutions = 0;
    grandFlag = true;
    vector<vector<int> > pz(h, vector<int>(5));
    for(int i=0; i<h; i++)
      for(int j=0; j<5; j++)
	cin >> pz[i][j];

    slv(pz);
    cout << solutions << endl;
    cin >> h;
  }

  return 0;
}