import java.util.*;

public class main {
    public static void main(String[] args) {
        // Step 1: Use a Scanner to read input
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] numbers = new int[N];
        for (int i = 0; i < N; i++) {
            numbers[i] = sc.nextInt();
        }

        // Step 2: Use a HashMap instead of a Hashtable
        Map<Integer, Integer> agenda = new HashMap<Integer, Integer>();
        for (int n : numbers) {
            agenda.put(n, agenda.getOrDefault(n, 0) + 1);
        }

        // Step 3: Use a variable to keep track of the minimum value as we go
        int minimum = Integer.MAX_VALUE;
        for (int n : numbers) {
            if (n < minimum) {
                minimum = n;
            }
        }
        agenda.remove(minimum);

        // Step 4: Calculate the result using the formula
        int modulo = (int) Math.pow(10, 9) + 7;
        long result = 1;
        for (int count : agenda.values()) {
            result = (result * (count + 1)) % modulo;
        }

        // Step 5: Print the result
        System.out.println(result);
    }
}