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 <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int solve(vector<vector<int> >& a)
{
    int h = a.size();
    int w = a[0].size();

    int ret = 0;
    for(int y=0; y<h; ++y){
        int cnt = 0;
        for(int x=0; x<w; ++x){
            ++ cnt;
            if(x == w-1 || a[y][x] != a[y][x+1]){
                if(a[y][x] != -1 && cnt >= 3){
                    ret += a[y][x] * cnt;
                    for(int i=0; i<cnt; ++i)
                        a[y][x-i] = -1;
                }
                cnt = 0;
            }
        }
    }

    for(int x=0; x<w; ++x){
        int y2 = h-1;
        for(int y=h-1; y>=0; --y){
            if(a[y][x] != -1){
                if(y < y2){
                    a[y2][x] = a[y][x];
                    a[y][x] = -1;
                }
                -- y2;
            }
        }
    }

    return ret;
}

int main()
{
    for(;;){
        int h;
        cin >> h;
        if(h == 0)
            return 0;

        vector<vector<int> > a(h, vector<int>(5));
        for(int y=0; y<h; ++y){
            for(int x=0; x<5; ++x){
                cin >> a[y][x];
            }
        }

        int ret = 0;
        for(;;){
            int p = solve(a);
            if(p == 0)
                break;
            ret += p;
        }
        cout << ret << endl;
    }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>

typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;

void solve(int h){
    vector<vector<int> > mp(5,vector<int>(h));
    for(int i = h-1; i >= 0; i--){
        for(int j = 0; j < 5; j++){
            cin >> mp[j][i];
        }
    }
    ll ans = 0;
    ll pre_ans = 0;
    int ch = h;
    // cout << "inputted" << endl;
    while(true){
        for(int i = ch-1; i >= 0; i--){
            int str = 0;
            int pre = 0;
            int j;
            for(j = 0; j < 5; j++){
                if(mp[j].size() <= i || (str != 0 && mp[j][i] != pre)){
                    if(str >= 3) break;
                    str = 1;
                    pre = mp[j][i];
                    continue;
                }
                if(mp[j][i] == pre){
                    str++;
                } else {
                    pre = mp[j][i];
                    str = 1;
                }
            }
            // cout << "evaluated" << endl;
            // cout << "i:" << i << " j:" << j << " str:" << str << endl;
            if(str >= 3){
                int st = j-str;
                for(int k = st; k < j; k++){
                    auto it = mp[k].begin();
                    it+=i;
                    ans+=(*it);
                    mp[k].erase(it);
                }
            }
        }

        int tmp = 0;
        for(int i = 0; i < 5; i++){
            int height = mp[i].size();
            tmp = max(tmp,height);
        }
        ch = tmp;

        if(ans == pre_ans) break;
        else pre_ans = ans;

        
        // cout << "in while" << endl;
    }

    cout << ans << endl;
}

int main(){
    while(true){
        int h;
        cin >> h;
        if(h == 0) break;
        else solve(h);
    }
    return 0;
}

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

long long int solutions;
bool grandFlag;

void print(vector<vector<int> >& pz){
  for(int i=0; i<pz.size(); i++){
    for(int j=0; j<5; j++)
      cout << pz[i][j] << " ";
    cout << endl;
  }
};

void solve(vector<vector<int> >& pz){
  for(int i=pz.size()-1; i>=0; i--){
    int a = pz[i][0], x = 1, pos = 0;
    bool yes = false;
    for(int j=1; j<5; j++){
      if(pz[i][j] == 0)
	continue;
      if(pz[i][j] == a)
	x++;
      else if(x>=3) {
	yes = true;
	pos = j-1;
	break;
      }
      else{
	x = 1;
	a = pz[i][j];
      }
      if(j == 4 && x>=3){
	yes = true;
	pos = j;
      }
    }
    if(yes == 1){
      for(int j=pos; j>pos-x; j--)
	pz[i][j] = 0;
      solutions += (a*x);
      grandFlag = true;
    }
  }
};

void simplify(vector<vector<int> >& pz){
  int lowest; bool set;
  for(int j=0; j<5; j++){
    lowest = pz.size();
    set = false;
    for(int i=pz.size()-1; i>=0; i--){
      if(pz[i][j] == 0 && !set){
	lowest = i;
	set = true;
      }
      else if(pz[i][j] != 0 && set){
	swap(pz[i][j], pz[lowest][j]);
	lowest--;
      }
    }
  }
};

void slv(vector<vector<int> >& pz){
  while(grandFlag){
    grandFlag = false;
    solve(pz); 
    simplify(pz);
  }
};

int main(){
  vector<long long int> sol;
  int h;
  cin >> h;
  while(h!=0){
    solutions = 0;
    grandFlag = true;
    vector<vector<int> > pz(h, vector<int>(5));
    for(int i=0; i<h; i++)
      for(int j=0; j<5; j++)
	cin >> pz[i][j];

    slv(pz);
    sol.push_back(solutions);
    cin >> h;
  }
  for(int i=0; i<sol.size(); i++)
    cout << sol[i] << endl;

  return 0;
}