use std::collections::*;

#[allow(unused)]
struct Scanner<R: std::io::BufRead> {
    stack: VecDeque<String>,
    input: R,
}
impl<R: std::io::BufRead> Scanner<R> {
    fn new(input: R) -> Self {
        Self {
            stack: VecDeque::<String>::new(),
            input: input,
        }
    }
    fn take(&mut self) -> Option<String> {
        if let Some(s) = self.stack.pop_front() {
            return Some(s);
        }
        self.enqueue_from_line();
        self.stack.pop_front()
    }
    fn enqueue_from_line(&mut self) {
        let mut t = String::new();
        self.input.read_line(&mut t).ok();
        t.trim()
            .split_ascii_whitespace()
            .for_each(|s| self.stack.push_back(s.to_owned()));
    }
}

macro_rules! scan {
    ($io:expr => $t:ty) => {
        $io.take().unwrap().parse::<$t>().unwrap()
    };
    ($io:expr => $t:tt * $n:expr) => ((0..$n).map(|_| scan!($io => $t)).collect::<Vec<_>>());
    ($io:expr => $($t:tt),*) => (($(scan!($io => $t)),*));
}

fn main() {
    solve(Scanner::<std::io::StdinLock>::new(std::io::stdin().lock()))
}

fn solve<R: std::io::BufRead>(mut cin: Scanner<R>) {
    let n = scan!(cin => i32);
    let aa = scan!(cin => i32 * n);
    let mut one = 0 as i64;
    let mut two = 0 as i64;
    let mut three = 0 as i64;
    for a in aa {
        match a {
            1 => one += 1,
            2 => two += 1,
            _ => three += 1,
        }
    }
    let mut total = 0;
    total += 2 * one * (one - 1) / 2;
    total += 1 * two * (two - 1) / 2;
    total += 1 * three * (three - 1) / 2;
    total += 3 * one * two;
    total += 2 * one * three;
    total += 1 * two * three;
    println!("{}", total);
}