#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define fi first
#define se second
#define re0 return 0
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tup = tuple<ll, ll, ll>;
using cp = complex<double>;
constexpr ll inf = 2e9;
constexpr ll llinf = 9e18;
//constexpr ll MOD = 998244353;
constexpr ll MOD = 1000000007;
const double pai = acos(-1);

int main() {
    //cout<<fixed<<setprecision(15);
    ll n;cin>>n;
    vector<ll> a(n);
    ll cnt1=0,cnt2=0;
    rep(i,n){
        cin>>a[i];
        if(a[i]==1)cnt1++;
        if(a[i]==2)cnt2++;
    }
    ll ans=0;
    rep(i,n){
        if(a[i]==1){
            cnt1--;
            ans+=cnt1*2+cnt2*3+n-i-cnt1-cnt2-1;
        }
        else if(a[i]==2){
            cnt2--;
            ans+=cnt1*3+n-i-cnt1-1;
        }
        else ans+=cnt1*2+n-i-cnt1-1;
    }
    cout<<ans<<endl;
}