#include <bits/stdc++.h>
#include <atcoder/all>

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007LL; //998244353LL;
static const LLONG INF_NUM = LLONG_MAX / 20LL;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

static void task()
{
	int N;
	get(N);
	std::vector<LLONG> ai(N);
	for (int i = 0; i < N; i++) {
		get(ai[i]);
	}

	std::sort(ai.begin(), ai.end());

	int oneOver = N, twoOver = N;
	for (int i = 0; i < N; i++) {
		if (ai[i] > 1) {
			if(oneOver == N) oneOver = i;
		}
		if (ai[i] > 2) {
			if (twoOver == N) twoOver = i;
		}
	}

	LLONG ans = 0;
	for (int i = 0; i < N - 1; i++) {
		if (i < oneOver) {
			ans += 2LL * (LLONG)(oneOver - i - 1);
			ans += 3LL * (LLONG)(twoOver - oneOver);
			ans += 2LL * (LLONG)(N - twoOver);
		}
		else {
			ans += (LLONG)(N - i - 1);
		}
	}
	printf("%lld\n", ans);
}