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

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int> a, b;
    for (int i = 0; i < N; i++) {
        int h;
        cin >> h;
        a.push_back(h);
    }
    
    sort(a.begin(), a.end());

    for (int i = 0; i < N; i++) {
        b.push_back(1);
    }

    int n = 0;
    for (int i = 1; i < N; i++) {
        if (a[i] == a[i - 1]) {
            b[n]++;
        }
        else {
            n++;
        }
    }

    for (int i = n+1; i < N; i++) {
        b[i] = 0;
    }

    int megoldas = 1;
    for (int i = 1; i < N; i++) {
        if (b[i] != 0)
            megoldas *= b[i] + 1;
    }
    
    int meg = megoldas % 1000000007;
    cout << meg;

    /*for (int i = 0; i < N; i++) {
        cout << b.back() << " ";
        b.pop_back();
    }
    cout << endl;
    for (int i = 0; i < N; i++) {
        cout << a.back() << " ";
        a.pop_back();
    }*/
}

/*
5
5 1 2 3 2

1 2 2 3 5 -> 5 3 2 2 1
1 2 1 1   -> 1 1 2 1
*/