#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a.at(i);
  sort(ALL(a));
  int c1 = 0;
  ll ans = 0;
  rep(i, n) {
    if(a.at(i) == 1) {
      ans += i*2;
      c1++;
    } else if(a.at(i) == 2) {
      ans += c1*3;
      ans += (i-c1);
    } else {
      ans += c1*2;
      ans += (i-c1);
    }
  }
  cout << ans << endl;
  return 0;
}