#include <iostream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N;
vector<int> nums;

int calc(int i, int remain) {
    if (remain == 0) return 1;
    if (i == nums.size()) return 0;
    int a1 = nums[i] * calc(i+1, remain-1);
    int a2 = calc(i+1, remain);
    return a1 + a2;
}

signed main()
{
    cin >> N;
    int c;
    int A[200] = {0};
    REP(i,N) {
        cin >> c;
        A[c]++;
    }
    REP(i,101) {
        if (A[i]) {
            nums.push_back(A[i]);
        }
    }

    cout << calc(0, 3) % ((int)pow(10,9)+7) << endl;

    return 0;
}