#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int n;
    cin >> n;
    map<int, int> cnt;
    rep(i, n) {
        int a;
        cin >> a;
        if (a == 1)
            cnt[1]++;
        else if (a == 2)
            cnt[2]++;
        else
            cnt[3]++;
    }
    // mex=1 (2,2),(2,3),(3,2),(3,3)
    // mex=2 (1,3),(3,1),(1,1)
    // mex=3 (1,2),(2,1)
    cout << 3 * (cnt[1] * cnt[2]) +
                2 * (cnt[1] * cnt[3] + (cnt[1] * (cnt[1] - 1)) / 2) +
                1 * ((cnt[2] * (cnt[2] - 1) / 2) + (cnt[3] * (cnt[3] - 1) / 2) +
                     cnt[3] * cnt[2])
         << endl;
}