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>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
signed main() {
  int H, W = 5; 
  while (cin >> H, H!=0) {
    // v[W][H]
    vector<vector<int>> v(W, vector<int>(H, 0));
    for (int i = H-1; i>=0; i--) {
      for (int j = 0; j < W; j++) {
        int t;
        cin >> t;
        v[j][i]=t;
      }
    }
    
    // くそこーどりょうさんきじゃないですか
    int ans = 0;
    for (int i = 0; i < H; i++) {
      for (int j = H-1; j >= 0; j--) {
        int last = 0, cnt = 0;
        for (int k = 0; k < W; k++) {
          if (v[k].size() <= j) {
            if (cnt >= 3) {
              ans += v[k-1][j]*cnt;
              for (int l = k-cnt; l < k; l++) {
                v[l].erase(v[l].begin()+j);
              }
            }
            cnt = 0;
            last = 0;
          } else if (last == v[k][j]) {
            cnt++;
          } else {
            if (cnt >= 3) {
              ans += v[k-1][j]*cnt;
              for (int l = k-cnt; l < k;  l++) {
                v[l].erase(v[l].begin()+j);
              }
            }
            cnt = 1;
            last = v[k][j];
          }
        }
        if (cnt >= 3) {
          ans +=v[W-1][j]*cnt;
          for (int l = W-cnt; l < W; l++) {
            v[l].erase(v[l].begin()+j);
          }
        }
      }
    }
    
    cout << ans << endl;
  }
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;

int ans = 0;

bool check(vector<vector<int> >& vec){
    int n = (int)vec.size();
    bool ok = false;
    rep(i,n){
        int s=0, t=0;
        int cri = 0;
        if(vec[i][0] == vec[i][1] && vec[i][1] == vec[i][2] && vec[i][2] > 0){
            s = 0, t = 3;
            cri = vec[i][0];
            if(vec[i][3] == cri){
                t++;
                if(vec[i][4] == cri){
                    t++;
                }
            }
        }else if(vec[i][1] == vec[i][2] && vec[i][2] == vec[i][3] && vec[i][2] > 0){
            s = 1, t = 4;
            cri = vec[i][1];
            if(vec[i][4] == cri){
                t++;
            }
        }else if(vec[i][2] == vec[i][3] && vec[i][3] == vec[i][4] && vec[i][2] > 0){
            s = 2, t = 5;
            cri = vec[i][2];
        }
        for(int j = s; j < t; j++){
            ok |= true;
            vec[i][j] = -1;
        }
        ans += cri*(t-s);
    }
    return ok;
}

void down(vector<vector<int> >& vec)
{
    int n = (int)vec.size();
    for(int i = n-1;i >= 1;i--){
        rep(j,5){
            if(vec[i][j] == -1){
                for(int k = i-1; k >= 0; k--){
                    if(vec[k][j] > 0){
                        vec[i][j] = vec[k][j];
                        vec[k][j] = -1;
                        break;
                    }
                }
            }
        }
    }
}

int main()
{
    while(1){
        int h;
        cin >> h;
        if(h == 0){
            break;
        }
        ans = 0;
        vector<vector<int> > vec(h,vector<int>(5));
        rep(i,h){
            rep(j,5){
                cin >> vec[i][j];
            }
        }
        while(1){
            if(check(vec)){
                // rep(i,h){
                //     rep(j,5){
                //         cout << vec[i][j] << " ";
                //     }
                //     cout << "\n";
                // }
                down(vec);
                // rep(i,h){
                //     rep(j,5){
                //         cout << vec[i][j] << " ";
                //     }
                //     cout << "\n";
                // }
            }else{
                break;
            }
        }
        cout << ans << "\n";
    }
}

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

int main(){
    int H;
    while(cin >> H, H!=0){
        int point = 0;
        //??\???
        vector< vector<int> > board(5, vector<int>(H, 0));
        for(int i=H-1; i>=0; i--){
            for(int j=0; j<5; j++){
                cin >> board[j][i];
            }
        }
        //?¶????
        for(;;){
            bool isEnd = true;
            for(int i=0; i<H; i++){
                for(int j=0; j<3; j++){
                    if(board[j][i]==board[j+1][i] && board[j+1][i]==board[j+2][i]){

                        int tmp = board[j][i];
                        if(tmp==0) break;
                        isEnd = false;
                        for(int k=0; j+k<5; k++){
                            if(board[j+k][i]==tmp){
                                point+=tmp;
                                board[j+k][i]=0;
                            }
                        }
                    }
                }
            }
            for(int i=0; i<5; i++) remove(board[i].begin(), board[i].end(), 0);
            if(isEnd) break;
        }
    cout << point << endl;
    }
    return 0;
}