#include <bits/stdc++.h>
using namespace std;

int main() {
    long long count = 0;
    cin >> count;
    long long lowest = 2e9+7;
    map<long long, long long> quantity;
    for (long long i = 0; i < count; i++) {
        long long num;
        cin >> num;
        if (num < lowest) lowest = num;
        quantity[num]++;
    }
    long long solution = 1;
    for (pair<long long, long long> num : quantity) {
        if (num.first == lowest) continue;
        solution *= num.second+1;
        solution = solution % 1000000007;
    }

    cout << solution << endl;
    return 0;
}