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

int main(){
  while(1){
    int H;
    cin>>H;

    if(H==0){
      break;
    }

    int S[10][5];
    for(int y=0;y<H;y++){
      for(int x=0;x<5;x++){
        cin>>S[y][x];
      }
    }

    int sco=0;

    while(1){
      bool flg=0;

      for(int y=0;y<H;y++){
        int m=S[y][2];
        if(m==0){
          continue;
        }

        if(S[y][0]==m&&S[y][1]==m){
          sco+=m*3;
          S[y][0]=S[y][1]=S[y][2]=0;
          flg=1;
          if(S[y][3]==m){
            sco+=m;
            S[y][3]=0;
            if(S[y][4]==m){
              sco+=m;
              S[y][4]=0;
            }
          }
        }else if(S[y][1]==m&&S[y][3]==m){
          sco+=m*3;
          S[y][1]=S[y][2]=S[y][3]=0;
          flg=1;
          if(S[y][4]==m){
            sco+=m;
            S[y][4]=0;
          }
        }else if(S[y][3]==m&&S[y][4]==m){
          sco+=m*3;
          S[y][2]=S[y][3]=S[y][4]=0;
          flg=1;
        }
      }

      if(!flg){
        break;
      }

      for(int x=0;x<5;x++){
        for(int y=H-1;y>=0;y--){
          if(S[y][x]!=0){
            continue;
          }

          for(int y2=y-1;y2>=0;y2--){
            if(S[y2][x]!=0){
              S[y][x]=S[y2][x];
              S[y2][x]=0;
              break;
            }
          }
        }
      }
    }
    cout<<sco<<endl;
  }
  return 0;
}

C++: //莉頑律縺ョ謌先棡*AOJ0027*AOJ0028


#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(int x){stringstream ss;ss<<x;return ss.str();}
int main(){
	
	int h,ans=0;
	while(cin>>h,h){
	ans=0;
	int ta[200][5]={{0},{0}};
	for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>ta[i][j];
	//逶、髱「縺ョ蟄伜惠縺励↑縺?→縺薙ｍ縺ッ0
	while(true){
	bool f=1;
	for(int i=0;i<h;i++){
	int cnt=0,fi=0;
		for(int j=0;j<3;j++){
			if(ta[i][j]==ta[i][j+1]&&ta[i][j]==ta[i][j+2]&&ta[i][j]!=0){
			cnt++;
			if(fi==0)fi=j;
			}
		}//endfor
		if(cnt!=0)ans+=ta[i][fi]*(2+cnt),f=0;
		if(cnt!=0)for(int j=0;j<2+cnt;j++)ta[i][fi+j]=0;
	}//endfor
	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||ta[ti+1][j]!=0)break;
			ta[ti+1][j]=ta[ti][j];
			ta[ti][j]=0;
			ti++;
			}//endwhile
		}//endfor
	}//endfor
	}//endwhile
	cout<<ans<<endl;
	}//endwhile
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

int main(){
	int stone[10][5];
	int h;
	while(scanf("%d",&h) && h!=0){
		int score=0;
		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				scanf("%d",&stone[i][j]);
			}
		}

		int a=1;
		while(a!=0){
			a=0;
			for(int i=0;i<h;i++){
				if((stone[i][0]==stone[i][1]) && (stone[i][1]==stone[i][2]) && (stone[i][2]==stone[i][3]) && (stone[i][3]==stone[i][4])){
					score += stone[i][0]*5;
					for(int j=i;j>0;j--){
						for(int k=0;k<5;k++){
							stone[j][k] = stone[j-1][k];
						}
					}
					for(int j=0;j<5;j++){
						stone[0][j] = 10+j;
					}
					a++;
				}else if((stone[i][0]==stone[i][1]) && (stone[i][1]==stone[i][2]) && (stone[i][2]==stone[i][3])){
					score += stone[i][0]*4;
					for(int j=i;j>0;j--){
						for(int k=0;k<4;k++){
							stone[j][k] = stone[j-1][k];
						}
					}
					for(int j=0;j<4;j++){
						stone[0][j] = 10+j;
					}
					a++;
				}else if((stone[i][1]==stone[i][2]) && (stone[i][2]==stone[i][3]) && (stone[i][3]==stone[i][4])){
					score += stone[i][1]*4;
					for(int j=i;j>0;j--){
						for(int k=1;k<5;k++){
							stone[j][k] = stone[j-1][k];
						}
					}
					for(int j=1;j<5;j++){
						stone[0][j] = 10+j;
					}
					a++;
				}else if((stone[i][0]==stone[i][1]) && (stone[i][1]==stone[i][2])){
					score += stone[i][0]*3;
					for(int j=i;j>0;j--){
						for(int k=0;k<3;k++){
							stone[j][k] = stone[j-1][k];
						}
					}
					for(int j=0;j<3;j++){
						stone[0][j] = 10+j;
					}
					a++;
				}else if((stone[i][1]==stone[i][2]) && (stone[i][2]==stone[i][3])){
					score += stone[i][1]*3;
					for(int j=i;j>0;j--){
						for(int k=1;k<4;k++){
							stone[j][k] = stone[j-1][k];
						}
					}
					for(int j=1;j<4;j++){
						stone[0][j] = 10+j;
					}
					a++;
				}else if((stone[i][2]==stone[i][3]) && (stone[i][3]==stone[i][4])){
					score += stone[i][2]*3;
					for(int j=i;j>0;j--){
						for(int k=2;k<5;k++){
							stone[j][k] = stone[j-1][k];
						}
					}
					for(int j=2;j<5;j++){
						stone[0][j] = 10+j;
					}
					a++;
				}
			}
		}
		cout<<score<<endl;
	}
	return 0;
}