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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int h;
    while (cin >> h, h) {
        vector<vector<int>> field(5, vector<int>(h));
        for (int j = h - 1; j >= 0; j--) {
            for (int i = 0; i < 5; i++) cin >> field[i][j];
        }
        int ans = 0;
        bool update = true;
        while (update) {
            update = false;
            // check
            vector<vector<int>> alive(5, vector<int>(h, 1));
            vector<vector<int>> v_idxs = {
                {0, 1, 2, 3, 4}, {0, 1, 2, 3}, {1, 2, 3, 4},
                {0, 1, 2}, {1, 2, 3}, {2, 3, 4}
            };
            for (int j = 0; j < h; j++) {
                for (int k = 0; k < 6; k++) {
                    auto& idxs = v_idxs[k];
                    int size = idxs.size();
                    bool f = true;
                    for (int i2 = 0; i2 < size - 1; i2++) { // i2, i2 + 1: zip
                        if (field[idxs[i2]][j] + field[idxs[i2 + 1]][j] == 0) {
                            f = false;
                        }
                        f &= field[idxs[i2]][j] == field[idxs[i2 + 1]][j];
                    }
                    if (f) {
                        for (int i: idxs) alive[i][j] = 0, ans += field[i][j];
                        update = true;
                        break;
                    }
                }
            }
            // update
            for (int i = 0; i < 5; i++) {
                int jt = 0;
                for (int j = 0; j < h; j++) if (alive[i][j]) {
                    field[i][jt++] = field[i][j];
                }
                while (jt < h) field[i][jt++] = 0;
            }
        }
        cout << ans << endl;
    }
    return 0;
}

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

int main(){
  while(1){
    int N;
    cin >> N ;
    if(N==0){
      break;
    }
    int str[11][6]={0};
    for(int i=N-1;i>=0;i--){
      for(int j=0;j<5;j++){
        cin >> str[i][j];
      }
    }
    int score=0;
    for(int i=0;i<10;i++){
//    for(int q=0;q<N;q++){
//     for(int w=0;w<5;w++){
//       cout << str[q][w];
//     }
//     cout << endl;
//    }
//    cout << endl;
      for(int j=0;j<N;j++){
        int a=str[j][0];
        int ch=0;
        for(int k=0;k<=5;k++){
          if(a==str[j][k]&&a!=0){
            ch++;
          }else{
            if(ch>=3){
              for(int l=k-1;l>=k-ch;l--){
                score+=str[j][l];
                str[j][l]=0;
              }
              break;
            }else{
              a=str[j][k];
              ch=1;
            }
          }
        }
      }
      for(int j=0;j<N;j++){
        for(int k=0;k<N;k++){
          for(int l=0;l<5;l++){
            if(str[k][l]==0){
              str[k][l]=str[k+1][l];
              str[k+1][l]=0;
            }
          }
        }
      }
    }
//    for(int q=0;q<N;q++){
//     for(int w=0;w<5;w++){
//       cout << str[q][w];
//     }
//     cout << endl;
//    }
    cout << score << endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    
    while (1) {
        int a[15][6]{};
        int h;
        cin >> h;
        if (h == 0) break;
        for (int i = h-1; i >= 0; i--) {
            for (int j = 0; j < 5; j++) cin >> a[i][j];
        }
        int ans = 0, t = 1;
        while (1) {
            bool flag = false;
            for (int i = 0; i < h; i++) {
                t = 1;
                for (int j = 0; j < 5; j++) {
                    if (a[i][j] == a[i][j + 1])
                        t++;
                    else {
                        if (t >= 3) {
                            flag = true;
                            for (int k = 0; k < t; k++) {
                                ans += a[i][j - k];
                                a[i][j - k] = 0;
                            }
                            
                        }
                        t = 1;
                    }
                    if(a[i][j]==0)t=1;
                }
            }
            if(!flag)break;
            for(int i=0;i<h;i++){
                for(int j=0;j<5;j++){
                    if(a[i][j]==0){
                        int k = i+1;
                        while(1){
                            if(k>h || a[k][j]>0){
                                a[i][j] = a[k][j];
                                a[k][j] = 0;
                                break;
                            }
                            k++;
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}