#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

const int mod = 1000000007;

int main() {
    long long n;
    cin >> n;
    long long x;
    map<long long,long long> data;
    for(long long i=0;i<n;i++)
        {
        cin>>x;
        data[x]++;
        }
    long long ans = 1;
    long long minim = (*data.begin()).first;
    for(auto p : data)
        {
        if(p.first != minim)
            ans = (ans*(p.second + 1)) % mod;
        }
    cout << ans;
    return 0;
}