#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cstdint>

std::vector<int> beolvas(std::istream &be) {
    int n;
    be >> n;

    std::vector<int> v(n);
    for (auto i = 0; i < n; i++) {
        be >> v[i];
    }

    return v;
}

void feldolgoz(const std::vector<int> &v) {
    const auto min = *std::min_element(v.cbegin(), v.cend());

    std::unordered_map<int, uint64_t> db;
    for (auto x: v) {
        db[x]++;
    }

    uint64_t c = 1;
    for (const auto &p : db) {
        if (p.first != min) {
            c = (c * (p.second + 1)) % 1000000007ULL;
        }
    }

    std::cout << c << std::endl;
}

int main() {
    const auto v = beolvas(std::cin);
    feldolgoz(v);

    return 0;
}