#include <list>
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>

#define MOD ((long long) 1e9 + 7)

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> elements(n);

    for (int& element : elements) {
        cin >> element;
    }
    sort(elements.begin(), elements.end());
    elements.push_back(-1);

    int last = elements[0];
    int last_count = 1;

    long long sum = 1;

    for (int i = 1; i <= n; i++) {
        if (elements[i] == last) last_count++;
        else if (elements[i] != elements[0])
        {
            sum *= last_count + 1;
            sum = sum % MOD;
            last_count = 1;
        }
        last = elements[i];
    }

    cout << sum;

    return 0;
}