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++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;
#define debug2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define debugg(g,h,w) rep(i,0,h) { rep(j,0,w) cout << g[i][j] << " "; cout << endl;}
#define debugv(v) for(auto&& x : v){cout << x << " ";} cout << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef vector<vector<int> > VVi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
typedef pair<ll, ll> Pll;

int g[10][5];
int n;
int score;

int check()
{
	int ret = 0;

	rep(i,0,n) rep(j,0,3) {
		if (g[i][j] > 0 && g[i][j] == g[i][j+1] && g[i][j] == g[i][j+2]) {
			int num = g[i][j];
			int same = 0;
			rep(k,0,5) if (g[i][k] == num) {
				same++;
				g[i][k] = -1;
			}
			score += num * same;
			ret++;
			continue;
		}
	}
	return ret;
}

void down()
{
	bool update = true;
	while (update) {
		update = false;
		rep(i,0,n-1) rep(j,0,5) {
			if (g[i][j] > 0 && g[i+1][j] == -1) {
				swap(g[i][j], g[i+1][j]);
				update = true;
			}
		}
	}
}

int main()
{
	while (1) {
		cin >> n;
		if (!n) break;
		rep(i,0,n) rep(j,0,5) cin >> g[i][j];
		score = 0;
		
		while (1) {
			int a = check();
			if (!a) break;
			down();
		}
		cout << score << endl;
	}
	
	return 0;
}

C++: #include <iostream>
using namespace std;
static const int N = 10;
int main(){
  int H,i,j,k,l,com,cnt,start,score,flag;//com=compare
  char c;
  string str[N],cp[N];
  while(1){
    score=0;
    cin >> H;
    if(H==0) break;
    for(i=0;i<H;i++){
      str[i]="";
      for(j=0;j<5;j++){
	cin >> c;
	str[i]+=c;
      }
    }
    while(1){
      for(i=0;i<H;i++){
	cnt=0;
	com=str[i][0];
	start=0;
	for(j=0;j<5;j++){
	  if(com==str[i][j]) cnt++;
	  else{
	    if(cnt>=3){
	      if(com!='e'){
		score+=cnt*(com-'0');
	      }
	      for(k=start;k<=j-1;k++){
		str[i][k]='e';//e=end
	      }
	      com=str[i][j];
	      start=j;
	      cnt=1;
	    }else{
	      com=str[i][j];
	      start=j;
	      cnt=1;
	    }
	  }
	}
	if(cnt>=3){
	  if(com!='e'){
	    score+=cnt*(com-'0');
	  }
	  for(k=start;k<=j;k++){
	    str[i][k]='e';//e=end
	  }
	}
      }
      for(i=0;i<5;i++){
	for(j=H-1;j>=0;j--){
	  if(j-1>=0&&str[j][i]=='e'){
	    l=j;
	    while(1){
	      l--;
	      if(l==-1) break;
	      if(str[l][i]!='e'){
		str[j][i]=str[l][i];
		str[l][i]='e';
		break;
	      }
	    }
	  }
	}
      }
      flag=0;
      for(i=0;i<H;i++) if(cp[i]!=str[i]) flag=1;
      if(flag==0) break;
      for(i=0;i<H;i++) cp[i]=str[i];
    }
    cout << score << endl;
  }
  return 0;
}

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 < W; i++) {
      for (int j = H-1; j >= 0; j--) {
        int last = -1, cnt = 0;
        for (int k = 0; k < W; k++) {
          if (v[k].size() <= j) {
            cnt = 1;
            last = -1;
          } 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-1; l++) {
            v[l].erase(v[l].begin()+j);
          }
        }
      }
    }
    
    cout << ans << endl;
  }
}