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++: #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;

int main()
{
	int N;
	while (cin >> N, N)
	{
		vector<vector<int> >data;
		data.clear();
		data.resize(N);
		for (size_t i = 0; i < N; i++)
		{
			data[i].resize(5);
			for (size_t j = 0; j < 5; j++)
			{
				cin >> data[i][j];
			}
		}
		int ans = 0;
		bool f = 1;
		while (f)
		{
			f = 0;
			for (size_t i = 0; i < N; i++)
			{
				int a = data[i][0];
				int b;
				int count = 1;
				int count2 = 0;
				for (size_t j = 1; j < 5; j++)
				{
					if (data[i][j] == a&&data[i][j])
					{
						count++;
					} else
					{
						if (count2 < count)
						{
							count2 = count;
							b = a;
						}
						a = data[i][j];
						count = 1;
					}
				}
				if (count2 < count)
				{
					count2 = count;
					b = data[i][4];
				}
				if (count2 >= 3)
				{
					f = 1;
					ans += count2*b;
					for (size_t j = 0; j < 5; j++)
					{
						if (data[i][j] == b)
						{
							data[i][j] = 0;
						}
					}
				}
			}
			for (int i = N - 1; i >= 0; i--)
			{
				//cout << "?" << endl;
				for (size_t j = 0; j < 5; j++)
				{
					if (data[i][j] == 0)
					{
						int k = i;
						while (k >= 0 && data[k][j] == 0)
						{
							k--;
						}
						if (k < 0)data[i][j] = 0;
						else
						{
							data[i][j] = data[k][j];
							data[k][j] = 0;
						}
					}
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include "bits/stdc++.h"
using namespace std;
int main() {
	int H,pazzle[10][5];
	while(scanf("%d",&H),H) {
		for(int i=0;i<H;i++) {
			for(int j=0;j<5;j++) {
				scanf("%d",&pazzle[i][j]);
			}
		}
		int ans=0;
		while(1) {
			bool ok=0;
			for(int i=0;i<H;i++) {
				int len=1,add=0;
				for(int j=1;j<5;j++) {
					if(pazzle[i][j]==pazzle[i][j-1]) {
						len++;
					}else {
						if(len>=3) {
							add=pazzle[i][j-1]*len;
							for(int k=0;k<len;k++) pazzle[i][j-1-k]=0;
						}
						len=1;
					}
				}
				if(len>=3) {
					add=pazzle[i][4]*len;
					for(int k=0;k<len;k++) pazzle[i][4-k]=0;
				}
				if(add>0) ans+=add,ok=1;
			}
			if(!ok) break;
			for(int j=0;j<5;j++) {
				int pos=H-1;
				for(int i=H-1;i>=0;i--) {
					if(pazzle[i][j]>0) pazzle[pos--][j]=pazzle[i][j];
				}
				for(int i=pos;i>=0;i--) pazzle[i][j]=0;
			}
		}
		printf("%d\n",ans);
	}
}

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

int d[10][10], dd[10], H;
int main()
{
  while(true)
  {
    cin >> H;
    if(!H)
      break;
    for(int i = 0; i < H; i++)
      for(int j = 0; j < 5; j++)
        cin >> d[i][j];
    bool f = true;
    int p = 0;
    while(f)
    {
      f = false;
      for(int i = 0; i < 10; i++)
        dd[i] = 0;

      for(int y = 0; y < H; y++)
      {
        int n = 0;
        for(int x = 0; x < 3; x++)
          if(d[y][x] && d[y][x] == d[y][x + 1] && d[y][x + 1] == d[y][x + 2])
            n = x + 2;
        if(n > 0)
        {
          f = true;
          for(int x = n; x >= 0; x--)
          {
            p += d[y][x];
            int tmp = d[y][x];
            d[y][x] = 0;
            if(x == 0 || tmp != d[y][x - 1])
              break;
          }
        }
      }

      for(int y = H - 1; y >= 0; y--)
      {
        for(int x = 0; x < 5; x++)
        {
          if(!d[y - dd[x]][x])
            for(; y - dd[x] >= 0 && !d[y - dd[x]][x]; dd[x]++);
          d[y][x] = d[max(0, y - dd[x])][x];
        }
      }
      for(int x = 0; x < 5; x++)
        for(int y = 0; y < dd[x]; y++)
          d[y][x] = 0;
    }
    cout << p << endl;
  }
}