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 = 0; j < H; j++){
        for(int k = 0; k < 5; k++){
          cout << p[j][k];
        }
        cout << endl;
      }
*/    
      
      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;
              }
            }
          }
        }
      }

/*
      for(int j = 0; j < H; j++){
        for(int k = 0; k < 5; k++){
          cout << p[j][k];
        }
        cout << endl;
      }
      */
      
    }
    cout << ans << endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
typedef long long ll;

int main(){
	int H;
	cin >> H;
	
	while(H!=0){
		int puzzle[12][5];
		rep(i,H){
			rep(j,5){
				cin >> puzzle[i][j];
			}
		}
		
		bool allign = true;
		
		int ans = 0;
		
		while (allign){
			//まず０のところを落とす。
			for (int i = H-2; i >= 0; --i) {
				rep(j,5){
					int temp = i;
					if(puzzle[i][j] != 0){
						while(puzzle[temp+1][j] == 0){
							puzzle[temp+1][j] = puzzle[temp][j];
							puzzle[temp][j] = 0;
							temp++;
							if(temp == H-1) break;
						}
					}
				}
			}
			
			allign = false;
			
			rep(i,H){
				int count = 1;
				int id = 0;
				rep(j,4){
					if(puzzle[i][j] == 0) {
						if(count < 3){
							count = 1;
							continue;
						}else{
							continue;
						}
					}
					if(puzzle[i][j] == puzzle[i][j+1]){
						count++;
						id = j+1;
					}
					if(puzzle[i][j] != puzzle[i][j+1]){
						if(count < 3){
							count = 1;
						}else{
							break;
						}
					}
				}
				if(count >= 3){
					allign = true;
					for (int j = id - count + 1; j <= id ; ++j) {
						ans += puzzle[i][j];
						puzzle[i][j] = 0;
					}
				}
			}
		}
		
		cout << ans << endl;
		
		cin >> H;
	}
	
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
int h,ans;
while(cin>>h,h){
ans=0;
int t[200][5]={{0},{0}};
for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>t[i][j];
while(1){
bool f=1;
for(int i=0;i<h;i++){
int c=0,fi=-1;
for(int j=0;j<3;j++){
if(t[i][j]==t[i][j+1]&&t[i][j]==t[i][j+2]&&t[i][j]!=0){
c++;
if(fi==-1)fi=j;
}
}
if(c!=0)ans+=t[i][fi]*(2+c),f=0;
if(c!=0)for(int j=0;j<2+c;j++)t[i][fi+j]=0;
}
if(f)break;
for(int i=h-2;i>=0;i--){
for(int j=0;j<5;j++){
int ti=i;
while(true){
if(ti==h-1||t[ti+1][j]!=0)break;
t[ti+1][j]=t[ti][j];
t[ti][j]=0;
ti++;
}
}
}
}
cout<<ans<<endl;
}
return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int erase(vector<vector<int>>& bd){
	for(int i=0;i<bd.size();i++){
		for(int j=0;j<3;j++){
			if( bd[i][j]%10 == bd[i][j+1]%10 && bd[i][j+1]%10 == bd[i][j+2]%10 ){
				bd[i][j] += 10;
				bd[i][j+1] += 10;
				bd[i][j+2] += 10;
			}
		}
	}
	int points = 0;
	for(int i=0;i<bd.size();i++){
		for(int j=0;j<5;j++){
			if(bd[i][j] >= 10){
				points += bd[i][j]%10;
				bd[i][j] = 0;
			}
		}
	}
	return points;
}
void drop(vector<vector<int>>& bd){
	bool update = true;
	while(update){
		update = false;
		for(int i=1;i<bd.size();i++){
			for(int j=0;j<5;j++){
				if(bd[i][j] == 0 && bd[i-1][j] != 0){
					bd[i][j] = bd[i-1][j];
					bd[i-1][j] = 0;
					update = true;
				}
			}
		}
	}
}
bool solve(){
	int H;
	cin >> H;
	if(H == 0)return false;
	vector<vector<int>> bd(H,vector<int>(5));
	for(int i=0;i<H;i++){
		for(int j=0;j<5;j++){
			cin >> bd[i][j];
		}
	}
	int ret = 0,p;
	while((p = erase(bd)) != 0){
		ret += p;
		drop(bd);
	}
	cout << ret << endl;
	return true;
}



int main(void){
	while(solve()){
		
	}
	return 0;
}