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>
using namespace std;

using ll = long long;
using ull = unsigned long long;

const double PI = acos(-1);
const int inf = 2e9;
const long long INF = 2e18;
const long long MOD = 1e9+7;

#define sx(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i,n) for (int i = 0; i < n; i++)
#define ALL(a) begin(a),end(a)

int main(void) {
    int H;
    vector<int> res;
    while(cin >> H, H) {
        vector<vector<int>> B(H,vector<int>(5));
        REP(i,H) REP(j,5) cin >> B[i][j];
        int ans = 0;
        bool flag ;
        do {
            vector<vector<bool>> ers(H,vector<bool>(5,false));
            flag = false;
            REP(i,H) {
                int t = B[i][2];
                if (t == 0) continue;
                bool f5;
                f5 = true;
                REP(j,5) {
                    if (B[i][j] != t) f5 = false;
                }
                if (f5) {
                    REP(j,5) ers[i][j] = true;
                    ans += t * 5;
                    flag = true;
                }
                else if (B[i][0] == B[i][1] && B[i][1] == B[i][2] && B[i][2] == B[i][3]) {
                    REP(j,4) ers[i][j] = true;
                    ans += t * 4;
                    flag = true;
                }
                else if (B[i][3] == B[i][4] && B[i][1] == B[i][2] && B[i][2] == B[i][3]) {
                    for (int j=1;j<5;j++) ers[i][j] = true;
                    ans += t * 4;
                    flag = true;
                }
                else if (B[i][0] == t && B[i][1] == t) {
                    for (int j = 0; j <= 2; j++) ers[i][j] = true;
                    ans += t * 3;
                    flag = true;
                }
                else if (B[i][1] == t && B[i][3] == t) {
                    for (int j = 1; j <= 3; j++) ers[i][j] = true;
                    ans += t * 3;
                    flag = true;
                }
                else if (B[i][3] == t && B[i][4] == t) {
                    for (int j = 2; j <= 4; j++) ers[i][j] = true;
                    ans += t * 3;
                    flag = true;
                }
            }
            
            REP(j,5) {
                vector<int> hh(H);
                REP(i,H) {
                    int d = H - i - 1;
                    if (ers[d][j]) hh[i] = -1;
                    else hh[i] = B[d][j];
                }
                bool g = true;
                while(g) {
                    g = false;
                    REP(i,H) {
                        if (hh[i] == -1) {
                            g = true;
                            hh.erase(hh.begin() + i);
                            hh.pb(0);
                            break;
                        }
                    }
                }
                REP(i,H) {
                    B[H-i-1][j] = hh[i];
                }
            }
 
        } while(flag);
        res.pb(ans);
    }
    REP(i,res.size()) cout << res[i] << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back 
#define pf push_front 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i,n) for(int i=0;i<(n);i++)
#define All(v) v.begin(),v.end()
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;


main()
{
  int H;
  while( cin >> H, H ) {
    int data[11][5];

    Rep(i, H) Rep(j, 5) cin >> data[i][j];

    int sum = 0;
    while( 1 ) {
      bool flag = false;
      Rep(i, H) Rep(j, 5) {
	if( data[i][j] == 0  ) continue;
	int r = j+1;
	while( r < 5 ) {
	  if( data[i][j] != data[i][r] ) break;
	  r++;
	}
	if( r - j >= 3 ) {
	  //cout << i << " " << j << " " << r << endl;
	  sum += (r - j) * data[i][j];
	  for(int k=j; k<r; k++) data[i][k] = 0;
	  flag = true;
	}
      }

      if( flag ) {
	bool flag2 = true;
	while( flag2 ) {
	  flag2 = false;
	  for(int i=H; i>0; i--) {
	    for(int j=0; j<5; j++) {
	      if( data[i][j] == 0 && data[i-1][j] != 0 ) {
		flag2 = true;
		data[i][j] = data[i-1][j];
		data[i-1][j] = 0;
	      }
	    }
	  }
	}
      } else {
	break;
      }
    }

    cout << sum << endl;
  }
}