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>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define REP2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define REP(i, n) REP2(i, 0, n)
#define ALL(S) (S).begin(), (S).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);

  int H;
  while (cin >> H && H){

    int board[H][5];
    REP(i, H){
      REP(j, 5) cin >> board[i][j];
    }


    int  score  = 0;
    bool update = true;

    
    while (update){
      update = false;
      int next_board[H][5];
      memcpy(next_board, board, sizeof(board));
      
      // REP(i, H){
      //   REP(j, 5) cout << board[i][j] << " " ;
      //   cout << endl;
      // }
      // cout << endl;

      REP(i, H) REP(r, 6) REP(l, r) if (r - l >= 3 && board[i][l] >= 0){
        bool same = true;
        int value = board[i][l];
        REP2(k, l, r) if (board[i][k] != value) same = false;
        
        REP2(k, l, r) if (same){
          next_board[i][k] = -1;
        }
      }
      
      REP(i, H) REP(j, 5) if (board[i][j] != next_board[i][j]){
        update = true;
      }

      if (update){
        REP(i, H) REP(j, 5){
          if (board[i][j] >= 0 && next_board[i][j] == -1){
            score += board[i][j];
          }
          board[i][j] = next_board[i][j];
        }
        
        bool has_drop = true;
        while (has_drop){
          has_drop = false;
          
          REP(i, H - 1) REP(j, 5) if (board[i + 1][j] == -1 && board[i][j] >= 0){
            has_drop = true;
            swap(board[i + 1][j], board[i][j]);
          }
        }
      }
    }
    cout << score << endl;
    
    
  }
  
  return 0;
}

C++: #include<vector>
#include<iostream>
#define F(A, B, M) for(int A=B; A<M; A++)
using namespace std;

int printall(vector<vector<int> > wall, int H){
	F(i, 0, H){
		F(j, 0, 5){
			cout << wall[i][j] << ' ';
		}
		cout << endl;
	}
}
			

int main(){
	int H;
	cin >> H;
	while(H != 0){
		vector<vector<int> > wall;
		vector<int> line;
		int score=0, tmp;

		F(i, 0, H){
			line.clear();
			F(j, 0, 5){
				cin >> tmp;
				line.push_back(tmp);
			}
			wall.push_back(line);
		}
		F(r, 0, 20){
			F(i, 0, H){
				int cnt=1;
				F(j, 1, 5){
					if(wall[i][j] == -1)continue;
					if(wall[i][j] == wall[i][j-1]){
						cnt++;
						if(j == 4 && cnt >= 3){
							score += wall[i][j]*cnt;
							F(k, j-cnt+1, j+1){
								wall[i][k] = -1;
							}
						}
					}else if(cnt >= 3){
						score += wall[i][j-1]*cnt;
						F(k, j-cnt, j){
							wall[i][k] = -1;
						}
						cnt = 1;
					}else{
						cnt = 1;
					}
				}
			}
			//printall(wall, H);

			//fall
			for(int i=H-1; i>=0; i--){
				F(j, 0, 5){
					if(wall[i][j] == -1){
						for(int k=i-1; k>=0; k--){
							if(wall[k][j] != -1){
								wall[i][j] = wall[k][j];
								wall[k][j] = -1;
								break;
								}
						}
					}
				}
			}
		}

		cout << score << endl;
		cin >> H;
	}

}

C++: #define _USE_MATH_DEFINES
#include <cmath>
#include <string>
#include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <numeric>
#include <array>
#include <float.h>
#include <memory>
#include <functional>
#include <iomanip>
#include <queue>
#include <random>
#include <map>
#include <set>

#pragma warning(disable:4996)

using namespace std;

int table[15][5] = { 0 };

int DeletePiece(int H) {
  int score = 0;
  for (int y = 0; y < H; ++y) {
    bool d = false;
    vector<pair<int, int>> chain;
    chain.push_back({ 0,0 });
    int index = 0;
    for (int x = 1; x < 5; ++x) {
      if (table[y][x - 1] == table[y][x] && table[y][x] != 0) {
        ++chain[index].first;
        chain[index].second = table[y][x];
      }
      else{
        chain.push_back({ 0,table[y][x] });
        ++index;
      }
    }
    auto it = max_element(chain.begin(), chain.end(), [](auto& pair_1, auto& pair_2) {return pair_1.first < pair_2.first; });
    if (it->first >= 2) {
      for (int x = 0; x < 5; ++x) {
        if (table[y][x] == it->second) {
          table[y][x] = -1;
          score += it->second;
        }
      }
    }
  }
  return score;
}

void ReplacePiece(int H) {
  for (int y = H - 1; y >= 0; --y) {
    for (int x = 0; x < 5; ++x) {
      while (table[y][x] == -1) {
        for (int yy = y; yy > 0; --yy) {
          table[yy][x] = table[yy - 1][x];
        }
        table[0][x] = 0;
      }
    }
  }
}

int main() {
  while (true) {
    int H;
    int score = 0, tmp_score = 0;
    cin >> H;
    if (H == 0) {
      break;
    }
    for (int y = 0; y < H; ++y) {
      for (int x = 0; x < 5; ++x) {
        cin >> table[y][x];
      }
    }
    do {
      tmp_score = DeletePiece(H);
      score += tmp_score;
      ReplacePiece(H);
    } while (tmp_score != 0);
    cout << score << endl;
  }
  return 0;
}