#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n;
    unsigned long long int megoldas = 1;
    cin >> n;
    vector<int> tomb(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> tomb[i];
    }
    sort(tomb.begin(), tomb.end());
    for (int i = n-1; i >= 0 and tomb[i]!=tomb[0]; --i)
    {
        int szam = tomb[i];
        int szamszama = 1;
        while (i-1 >= 0 and szam == tomb[i - 1])
        {
            ++szamszama; --i;
        }
        megoldas *= szamszama + 1;
        megoldas %= 1000000007;
    }
    cout << megoldas;
}