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;

int main(){
  while(1){
    int H;
    cin>>H;

    if(H==0)
      break;

    int S[10][5];
    for(int y=0; y<H; y++){
      for(int x=0; x<5; x++){
        cin>>S[y][x];
      }
    }

    int sco = 0;

    while(1){
      bool flg = false;

      for(int y=0; y<H; y++){
        int m = S[y][2];
        if(m==0)
          continue;

        if(S[y][0]==m && S[y][1]==m){
          sco+= m*3;
          S[y][0] = S[y][1] = S[y][2] =0;
          flg = true;
          if(S[y][3] == m){
            sco += m;
            S[y][3] = 0;
            if(S[y][4] == m){
              sco+=m;
              S[y][4] = 0;
            }
          }
        }
        else if(S[y][1] == m && S[y][3] == m){
          sco += m*3;
          S[y][1] = S[y][2] = S[y][3] =0;
          flg = true;
          if(S[y][4] == m){
            sco+=m;
            S[y][4] = 0;
          }
        }
        else if(S[y][3] == m && S[y][4] == m){
          sco += m*3;
          S[y][2] = S[y][3] = S[y][4] =0;
          flg = true;
        }
      }
      if(!flg)
        break;

      for(int x=0; x<5; x++){
        for(int y=H-1; y>=0; y--){
          if(S[y][x]!=0)
            continue;

          for(int y2=y-1; y2>=0; y2--){
            if(S[y2][x]!=0){
              S[y][x] = S[y2][x];
              S[2][x] = 0;
              break;
            }
          }
        }
      }
    }
    cout<<sco<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define rep1(i,n) for(int i=1;i<=(n);++i)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
int main(){
	while(true){
		int H;
		cin>>H;
		if(H==0) break;
		int a[10][5];
		rep(i,H) rep(j,5) cin>>a[H-1-i][j];
		int ans=0;
		while(true){
			bool update=false;
			rep(i,H){
				if(a[i][2]==-1) continue;
				int l=2,r=2;
				while(l>0){
					if(a[i][l-1]==a[i][2]) l--;
					else break;
				}
				while(r<4){
					if(a[i][r+1]==a[i][2]) r++;
					else break;
				}
				if(r-l+1>=3){
					update=true;
					ans+=a[i][2]*(r-l+1);
					for(int j=l;j<=r;j++) a[i][j]=-1;
				}
			}
			if(!update) break;
			rep(i,5){
				vector<int> vc;
				rep(j,H){
					if(a[j][i]!=-1) vc.pb(a[j][i]);
				}
				rep(j,vc.size()) a[j][i]=vc[j];
				for(int j=vc.size();j<H;j++) a[j][i]=-1;
			}
		}
		cout<<ans<<endl;
	}
}

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

#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

const int INF = 1e15;
const int MOD = 1e9+7;

void solve(int h){
    vector<vector<int>> a(h, vector<int>(5));
    for(int i = h-1; i >= 0; i--){
        rep(j, 5){
            cin >> a[i][j];
        }
    }

    bool able = true;

    int ans = 0;
    while(able){
        able = false;

        vector<vector<bool>> del(h, vector<bool>(5, false));

        rep(i, h){
            rep(j, 3){
                if(a[i][j] == 0){
                    continue;
                }

                if(a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2]){
                    able = true;
                    del[i][j] = true;
                    del[i][j+1] = true;
                    del[i][j+2] = true;
                }
            }
        }

        rep(i, h){
            rep(j, 5){
                if(del[i][j]){
                    ans += a[i][j];
                    a[i][j] = 0;
                }
            }
        }

        for(int i = 1; i < h; i++){
            rep(j, 5){
                int ni = i-1;
                while(ni >= 0 && a[ni][j] == 0){
                    a[ni][j] = a[ni+1][j];
                    a[ni+1][j] = 0;
                    ni--;
                }
            }
        }
    }
    cout << ans << endl;
}

signed main(){
    while(true){
        int h;
        cin >> h;

        if(h == 0){
            break;
        }

        solve(h);
    }

    return 0;
}