#include using namespace std; #define rep(i,a,b) for(int i=a;i> ABC[i]; cin >> N; rep(i, 0, N) cin >> E[i]; sort(ABC, ABC + 3); sort(E, E + N); dp[0][0] = 1; rep(i, 0, N) { int cnt = 0; rep(j, 0, 3) if (ABC[j] <= E[i]) cnt++; rep(j, 0, 4) { if (cnt == j) { dp[i + 1][j] += dp[i][j] * 2; } else if (cnt > j) { dp[i + 1][j] += dp[i][j]; dp[i + 1][j + 1] += dp[i][j]; } } } cout << dp[N][3] << endl; }