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;

#define WIDTH 5
#define MAX_HEIGHT 10
#define CHAIN_SIZE 3
#define EXTINCT -1//?¶?????????????
#define EMPTY -2//???????????¨?????????

void down(int h,  int stones[MAX_HEIGHT][WIDTH]){

  for(int i=0;i<h;i++){
    for(int j=0;j<WIDTH;j++){
      if(stones[i][j] == EXTINCT){
	int c;
	for(c=i; c<h-1; c++){
	  if(stones[c+1][j] == EMPTY){
	    break;
	  }	  
	  stones[c][j] = stones[c+1][j];
	}

	while(c<h){
	  stones[c][j] = EMPTY;
	  c++;
	}
      }
      
      if(stones[i][j] == EXTINCT){
	//???????????¨???????????????????????????EXTINCT?????£????????????????????????
	i--;
      }
    }
  }
  
}

int main(){
  int h;
  int stones[MAX_HEIGHT][WIDTH];
  cin>>h;

  while(h != 0){
    int ans = 0;
    for(int i=h-1;i>=0;i--){
      for(int j=0;j<WIDTH;j++){
	cin>>stones[i][j];
      }
    }


    bool finish = false;

    while(!finish){
       
      bool chained = false;
      for(int i=0;i<h;i++){
	int s = 0;
	int e = 0;
	for(int j=0;j<WIDTH-1;j++){
	  if(stones[i][j]==stones[i][j+1] && stones[i][j]!=EXTINCT && stones[i][j]!=EMPTY){
	    e++;
	    if(e-s+1 >= CHAIN_SIZE){//3??\????????£?¶??????????
	      int num = stones[i][s];
	      int c = 0;
	      chained = true;
	      while(s<WIDTH && stones[i][s] == num){
		stones[i][s] = EXTINCT;
		s++;
		c++;
	      }
	      ans += c*num;
	      e=s;
	    }
	  }else{
	    s = j+1;
	    e = j+1;
	  }
	}
	
      }

      down(h,stones);
      
      if(!chained){
	finish = true;
      }
    }
    
    cout<<ans<<endl;
    cin>>h;
  }
  

  return 0;
}

C++: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(),x.end()
#define ln '\n'
const long long MOD = 1000000007LL;
//const long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull; 
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
///////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    while (true) {
        int H; cin >> H;
        if (!H) break;
        vector<vector<int>> S(H, vector<int>(5));
        rep(i,H) rep(j,5) cin >> S[i][j];

        int ans = 0;
        while (true) {
            bool ok = false;
            rep(i,H) {
                if (S[i][0] && S[i][0] == S[i][1] && S[i][1]==S[i][2] && S[i][2]==S[i][3] && S[i][3]==S[i][4]) {
                    ok = true;
                    ans += 5*S[i][0];
                    rep(j,5) S[i][j] = 0;
                } else if (S[i][0] && S[i][0] == S[i][1] && S[i][1]==S[i][2] && S[i][2]==S[i][3]) {
                    ok = true;
                    ans += 4*S[i][0];
                    rep(j,4) S[i][j] = 0;
                } else if (S[i][1] && S[i][1]==S[i][2] && S[i][2]==S[i][3] && S[i][3]==S[i][4]) {
                    ok = true;
                    ans += 4*S[i][1];
                    rep(j,4) S[i][j+1] = 0;
                } else {
                    rep(j,3) {
                        if (S[i][j] && S[i][j]==S[i][j+1] && S[i][j+1] == S[i][j+2]) {
                            ok = true;
                            ans += 3*S[i][j];
                            rep(k,3) S[i][j+k] = 0;
                        }
                    }
                }
            }

            rep(j,5) {
                for (int i = H-1; i >= 0; --i) {
                    if (S[i][j]==0) {
                        int k = i-1;
                        while (k >= 0 && S[k][j]==0) --k;
                        if (k==-1) break;
                        S[i][j] = S[k][j];
                        S[k][j] = 0;
                    }
                }
            }
            /*
            rep(i,H) {
                rep(j,5) cout << S[i][j] << " ";
                cout << ln;
            }
            cout << ln;
            */
            if (!ok) break;
        }

        cout << ans <<ln;
    }
}

C++: #include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, s, n) for (signed i = (s); i < signed(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

const double EPS = 1e-9;

signed main() {
	int h;
	while (cin >> h && h) {
		VV board(h, V(5));
		rep(i, h) rep(j, 5) cin >> board[i][j];
		int score = 0;

		while (true) {
			int added = 0;
			VV next = board;
			rep(i, h) rep(j, 3) {
				if (board[i][j] == board[i][j + 1] && board[i][j] == board[i][j + 2]) {
					added += next[i][j] + next[i][j + 1] + next[i][j + 2];
					next[i][j] = next[i][j + 1] = next[i][j + 2] = 0;
				}
			}
			score += added;
			board = next;
			rep(j, 5) {
				int shift = 0;
				for (int i = h - 1; i >= 0; i--) {
					board[i + shift][j] = board[i][j];
					shift += board[i][j] == 0;
				}
			}
			if (added == 0) break;
		}

		cout << score << endl;
	}
}