#include <bits/stdc++.h>
using namespace std;
const int N = 3e5;
const int mod = 1e9 + 7;
const int NR = N;
int fact[NR  + 1],inv[NR + 1];
int p(int a,int b){
    int r = 1;
    while(b){
        if(b%2)r = 1ll*r*a%mod;
        a = 1ll*a*a%mod;
        b/=2;
    }
    return r;
}
void precalc(){
    fact[0] = 1;
    for(int i = 1;i <= NR;i++){
        fact[i] = 1ll*fact[i - 1]*i%mod;
    }
    inv[NR] = p(fact[NR],mod - 2);
    for(int i = NR - 1;i >= 0;i--){
        inv[i] = 1ll*inv[i + 1]*(i + 1)%mod;
    }
}
int comb(int n,int k){
    if(n < k || k < 0)return 0;
    return 1ll*fact[n]*inv[k]%mod*inv[n-k]%mod;
}
int n;
int v[N];
vector <int> v2;
int countm(){
    /// down up down up
    auto check = [&](int x) -> bool{
        if((x&2)){
            if(!(x&1) || !(x&4))return 0;
        }
        if((x&8)){
            if(!(x&4) || !(x&16))return 0;
        }
        return 1;
    };
    int m = v2.size();
    vector <vector<int>> dp(m + 1, vector<int>(32, 0));
    dp[m][0] = 1;
    for(int i = m - 1;i >= 0;i--){
        for(int j = 0;j < 32;j++){
            if(!check(j))continue;
            for(int k = j;k < 32;k = ((k + 1)|j)){
                if(!check(k))continue;
                if((k&2)){
                    if(!(j&1) || !(j&4))continue;
                }
                if((k&8)){
                    if(!(j&4) || !(j&16))continue;
                }

                int possib = v2[i];/// blocks
                int options = 0;/// separators
                ///places to put stuff in
                possib-=__builtin_popcount(k^j);
                options+=__builtin_popcount(k^j);
                if(!(k&2) && (j&1))options++;
                if(!(k&2) && (j&4))options++;
                if(!(k&8) && (j&4))options++;
                if(!(k&8) && (j&16))options++;
                //if(comb(possib + options - 1, options - 1) == 0)continue;
                dp[i][k] = (dp[i][k] + 1ll*dp[i + 1][j]*comb(possib + options - 1, options - 1)%mod)%mod;
                //cout<<i<<' '<<j<<' '<<k<<' '<<possib<<' '<<options<<' '<<comb(possib + options - 1, options - 1)<<'\n';
            }
        }
    }
    return dp[0][31];
}
int main(){
    precalc();
    cin>>n;
    for(int i = 0;i < n;i++){
        cin>>v[i];
    }
    sort(v, v + n);
    for(int i = 0;i < n;i++){
        int j = i;
        int cnt = 0;
        while(j < n && v[j] == v[i]){
            cnt++;j++;
        }
        v2.push_back(cnt);
        i = j - 1;
    }
    int x = countm();
    cout<<x<<'\n';
    return 0;
}
/// w shaped means entire array is w shape not a part? why?