#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

struct Solver {
    H: usize,
    visited: Vec<Vec<bool>>,
    clear: Vec<Vec<bool>>,
}

impl Solver {
    fn new(H: usize) -> Solver {
        Solver {
            H: H,
            visited: vec![vec![false; 5]; H],
            clear: vec![vec![false; 5]; H],
        }
    }
    fn check(&mut self, col: usize, row: usize, s: usize, b: &Vec<Vec<usize>>) -> usize {
        let mut cont = 0;
        for x in col..5 {
            if b[row][x] == s {
                self.visited[row][x] = true;
                cont += 1;
            } else {
                break;
            }
        }
        if cont >= 3 {
            for x in col..col+cont {
                self.clear[row][x] = true;
            }
            cont
        } else {
            0
        }
    }
}

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    loop {
        let H: usize = sc.get();
        if H == 0 {
            break;
        }
        let mut b: Vec<Vec<usize>> = sc.mat(H, 5);
        let mut ans = 0;
        let mut is_coutinued = true;
        while is_coutinued {
            is_coutinued = false;
            let mut s = Solver::new(H);
            for row in 0..H {
                for col in 0..5 {
                    let stone = b[row][col];
                    if s.visited[row][col] || stone == 0 {
                        continue;
                    }
                    let num = s.check(col, row, stone, &b);
                    is_coutinued |= num != 0;
                    ans += stone * num;
                }
            }
            for row in 0..H {
                for col in 0..5 {
                    if s.clear[row][col] {
                        for y in (1..row+1).rev() {
                            b[y][col] = b[y-1][col];
                        }
                        b[0][col] = 0;
                    }
                }
            }
        }
        println!("{}", ans);
    }
}



Measured memory_bytes: 5056