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 pfield(vector<vector<int> >, int);

int main() {
  int cols;
  while(cin >> cols, cols) {
    vector<vector<int> > field(5); // [col][line]
    for(int il = 0; il < cols; ++il) {
      for(int ic = 0; ic < 5; ++ic) {
        int num;
        cin >> num;
        field[ic].push_back(num);
      }
    }
    for(int ic = 0; ic < 5; ++ic) {
      reverse(field[ic].begin(), field[ic].end());
    }
    int score = 0;
    int lastScore = 0;
    do {
      lastScore = score;
      // Top down scan
      for(int il = cols - 1; il >= 0; --il) {
        int rowCnt = 0;
        int lastNum = -1;
        for(int ic = 0; ic < 5; ++ic) {
          if(field[ic].size() <= il) {
            rowCnt = 0;
            continue;
          }
          (field[ic][il] == lastNum) ? ++rowCnt : (rowCnt = 0);
          int eraseNum = lastNum;
          lastNum = field[ic][il];
          if(rowCnt == 2) {
            for(int dic = -2; dic <= 0; ++dic) {
              field[ic + dic].erase(field[ic + dic].begin() + il);
              score += eraseNum;
            }
          } else if(rowCnt > 2) {
            field[ic].erase(field[ic].begin() + il);
            score += eraseNum;
          }
        }
      }
    } while(score != lastScore);
    cout << score << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int h, tmp;
	while (cin >> h, h) {
		vector<vector<int>>v(h, vector<int>());
		rep(i, h) {
			rep(j, 5) {
				cin >> tmp;
				v[i].push_back(tmp);
			}
		}
		bool flag = true;
		int ns = 0;
		while (flag) {
			flag = false;
			//?¶????
			rep(i, h) {
				rep(j, 5) {
					tmp = 0;
					while (true) {
						if (v[i][j] == 0 || (j + tmp + 1) == 5)break;
						if (v[i][j] == v[i][j + tmp + 1])tmp++;
						else break;
					}
					if (tmp >= 2) {
						ns += v[i][j] * (tmp + 1);
						rep(k, tmp + 1)v[i][j + k] = 0;
						flag = true;
					}
				}
			}
			//?????¨???
			bool cont = true;
			while (cont) {
				cont = false;
				for (int i = h - 1; i > 0; i--) {
					rep(j, 5) {
						if (v[i][j] == 0 && v[i - 1][j]) {
							v[i][j] = v[i - 1][j];
							v[i - 1][j] = 0;
							cont = true;
						}
					}
				}
			}
		}
		cout << ns << endl;
	}		
	return 0;
}

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

int main() {
  int H;
  int stone[10][5];
  int i, j, k;
  int score;

  while(1) {
    score = 0;
    cin >> H;

    if(H == 0) break;
  
    for(i = 0; i < H; i++) {
      for(j = 0; j < 5; j++) {
	cin >> stone[i][j]; 
      }
    }
    
    while(1) {
      //石を消去
      int score_temp = 0;
      
      for(i = 0; i < H; i++) {
	for(j = 0; j < 3; j++) {
	  for(k = 1; k + j < 5; k++) {
	    if(stone[i][j] != stone[i][j+k]) {
	      break;
	    }
	  }
	  if(k < 3) {
	    continue;
	  }
	  for(int l = 0; l < k; l++) {
	    score_temp += stone[i][j+l];
	    stone[i][j+l] = 0;
	  }
	}
      }
      
      
      if(score_temp == 0) break;
      score += score_temp;
      
      //石を落下
      
      for(j = 0; j < 5; j++) {
	for(i = 0; i < H; i++) {
	  for(k = H-1; k > i; k--) {
	    if(stone[k][j] == 0) {
	      stone[k][j] = stone[k-1][j];
	      stone[k-1][j] = 0;
	    }
	  }
	}
      }
    }
    cout << score << endl;
  }  
  return 0;
}