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

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

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

	return v;
}

void negalo_rendezes(std::vector<int> v) {
	static constexpr int m = 1000000007;

	std::sort(v.begin(), v.end());
	const auto n = v.size();

	int db = 1;
	auto i = 0u;
	for (; i < n && v[i] == v[0]; i++) {}

	while (i < n) {
		auto j = i;
		int x = db;
		for (; j < n && v[j] == v[i]; j++) {
			x = (x + db) % m;
		}

		db = x;
		i = j;
	}

	std::cout << db << std::endl;
}

int main() {
	auto v = beolvas(std::cin);
	negalo_rendezes(std::move(v));

	return 0;
}