#include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<numeric>

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;

class MYCP {
public:

	static const LL TEISUU = 1000 * 1000 * 1000 + 7;

	static LL DebugFlag;

	//数値を区切って文字列にする
	static string MakeString_LongLong(vector<long long> const& numbers, string const& str) {
		if (numbers.size() == 0)return "";
		string result = "" + to_string(numbers[0]);
		for (long long i = 1; i < numbers.size(); i++) {
			result += str;
			result += to_string(numbers[i]);
		}

		return result;
	}

	//空白で区切る為のオーバーロード
	static string MakeString_LongLong(vector<long long> const& numbers) {
		if (numbers.size() == 0)return "";
		string result = "" + to_string(numbers[0]);
		for (long long i = 1; i < numbers.size(); i++) {
			result += " ";
			result += to_string(numbers[i]);
		}

		return result;
	}



	//文字列の配列を改行を挟んでまとめる
	static string MakeString_VectorString(vector<string> const& str) {
		string result = "";
		for (long long i = 0; i < str.size(); i++) {
			result += str[i] + "\n";
		}

		return result;
	}

	//文字列を必要な個数だけ読み取る
	static vector<string> MyReadLineSplit(LL n) {
		vector<string> str(n);
		for (long long i = 0; i < n; i++) {
			std::cin >> str[i];
		}

		return str;
	}

	//数値を必要な個数だけ読み取る
	static vector<long long> ReadInts(long long number) {
		vector<long long> a(number);
		for (int i = 0; i < number; i++) {
			std::cin >> a[i];
		}

		return a;
	}

	//渡された自然数が素数ならtureを返す
	static bool PrimeCheck_Int(long long number) {
		if (number < 2)return false;

		for (ULL i = 2; i*i <= number; i++) {
			if (number%i == 0)return false;
		}

		return true;
	}

	//渡された数値以下の素数表を作る
	static vector<long long> MakePrimeList(long long n) {
		vector<long long> list;
		LL i, j, p;
		bool flag;
		for (i = 2; i <= n; i++) {
			flag = true;
			for (j = 0; j < list.size(); j++) {

				if (!(list[j] * list[j] <= i))break;

				if (i%list[j] == 0) {
					flag = false;
					break;
				}
			}
			if (flag)list.push_back(i);
		}

		return list;
	}



	//文字列の分割
	static vector<string> split(string const& str, char sep)
	{
		vector<std::string> v;        // 分割結果を格納するベクター
		auto first = str.begin();              // テキストの最初を指すイテレータ
		while (first != str.end()) {         // テキストが残っている間ループ
			auto last = first;                      // 分割文字列末尾へのイテレータ
			while (last != str.end() && *last != sep)       // 末尾 or セパレータ文字まで進める
				last++;
			v.push_back(string(first, last));       // 分割文字を出力
			if (last != str.end())
				last++;
			first = last;          // 次の処理のためにイテレータを設定
		}
		return v;
	}

	//合計を求める
	static LL Sum(vector<LL> a) {
		LL i, sum = 0;

		for (i = 0; i < a.size(); i++) {
			sum += a[i];
		}

		return sum;
	}

	//小文字ならtrueを返す
	static bool Komoji(char a) {
		if (a >= 'a'&&a <= 'z')return true;

		return false;
	}

	//大文字ならtrueを返す
	static bool Oomoji(char a) {
		if (a >= 'A'&&a <= 'Z')return true;

		return false;
	}

	static LL GreatestCommonFactor(LL a, LL b) {
		LL temp;
		if (a < b) {
			temp = b;
			b = a;
			a = temp;
		}

		while (true)
		{
			temp = a % b;
			a = b;
			b = temp;
			if (b == 0)break;
		}

		return a;
	}

	static LL LeastCommonMultiple(LL a, LL b) {
		return (a / GreatestCommonFactor(a, b))*b;
	}

	static LL DebugPrintf(string output) {

		if (MYCP::DebugFlag != 0) {
			cout << output << endl;
		}

		return MYCP::DebugFlag;
	}

	static  LL DebugCin() {
		LL a;

		if (MYCP::DebugFlag != 0) {
			cin >> a;
		}

		return a;
	}
};
LL MYCP::DebugFlag = 0;

//累積和を求めるクラス
class Syakutori {
private:
	vector<LL> list;

public:

	void MakeArray(vector<LL> data) {
		LL i;
		list = data;
		list.push_back(0);
		list[0] = 0;
		for (i = 1; i < list.size(); i++) {
			list[i] = list[i - 1] + data[i - 1];
		}

	}

	LL Sum(LL start, LL end) {
		if (end < start) {
			cout << "startがendより大きいです";
			return 0;
		}
		if (start < 0 || end >= list.size()) {
			cout << "範囲が異常";
			return 0;
		}

		return list[end] - list[start];
	}

};

class MyBager {
public:
	VLL layer, meet;

	void set(LL n) {
		if (true) {
			VLL temp(n + 1), temp2;
			temp2 = temp;

			this->layer = temp;
			this->meet = temp2;

			this->layer[0] = 1;
			this->meet[0] = 1;

			for (LL i = 1;i <= n;i++) {
				this->layer[i] = this->layer[i - 1] * 2 + 3;
				this->meet[i] = this->meet[i - 1] * 2 + 1;
			}


		}
	}

	LL sum(LL x,LL n) {
		LL i, j, k, m;

		if (n == 0) {
			return x;
		}

		if (x == 0)return 0;

		if (x <= 1 + this->layer[n - 1]) {
			return this->sum(x - 1, n - 1);
		}

		if (x == 2 + this->layer[n - 1]) {
			return this->meet[n - 1] + 1;
		}

		if (x <= 2 + this->layer[n - 1] * 2) {
			return this->meet[n - 1] + 1 + this->sum(x - 2 - this->layer[n - 1], n - 1);
		}

		return this->meet[n - 1] * 2 + 1;
	}
};

void reverse(vector<char>& input) {
	auto temp = input;

	for (LL i = 0; i < input.size();i++) {
		input[i] = temp[temp.size() - 1 - i];
	}
}

vector<char> change(string input) {
	vector<char> result(input.size());

	for (LL i = 0;i < input.size();i++) {
		result[i] = input[i];
	}

	return result;
}

int main(void) {
	MYCP::DebugFlag = 0;

	LL i, j, k, n, m, x, flag;
	
	cin >> n;
	auto a = MYCP::ReadInts(n);

	VLL count(n, 0);

	for (i = 0;i < a.size();i++)count[a[i]]++;

	if (n % 2 == 0) {
		for (i = 0;i < n;i += 2) {
			if (count[i] != 0)goto NO;
		}

		for (i = 1;i < n;i += 2) {
			if (count[i] != 2)goto NO;
		}
	}

	else
	{
		if (count[0] != 1)goto NO;

		for (i = 2;i < n;i += 2) {
			if (count[i] != 2)goto NO;
		}

		for (i = 1;i < n;i += 2) {
			if (count[i] != 0)goto NO;
		}
	}

	
	k = 1;
	j = n / 2;

	for (i = 0;i < j;i++) {
		k *= 2;
		k %= MYCP::TEISUU;
	}

	cout << k << endl;
	return 0;




NO:
	MYCP::DebugPrintf("矛盾");

	cout << "0" << endl;
	return 0;
}


Measured memory_bytes: 1792