#include <iostream>

#define MOD 1000000007

using namespace std;

void processCaseWhenSumIsLessThanMod(int *tab, int *res, int n)
{
	int *resprim = new int[n];
	
	res[0] = (tab[0] & 1) ? 0 : 1; // liczba podziałów mopadulo
	resprim[0] = (tab[0] & 1) ? 1 : 0; // liczba podziałów, w których tylko ostatni nie jest mopadulo
	
	for (int i=1;i<n;++i)
	{
		if (tab[i] & 1) // nieparzyste
		{
			res[i] = resprim[i-1];
			resprim[i] = (2 * res[i-1]) % MOD;
		}
		else // parzyste
		{
			res[i] = (2 * res[i-1]) % MOD;
			resprim[i] = resprim[i-1];
		}
	}
	cout << res[n-1] << endl;
	delete[] resprim;
}

int main()
{
	int n;
	cin >> n;
	
	int *tab = new int[n];
	int *sums = new int[n+1];
	int *res = new int[n];
	
	long long sum = 0;
	
	sums[0] = 0;
	for (int i=0;i<n;++i)
	{
		cin >> tab[i];
		sums[i+1] = (sums[i] + tab[i]) % MOD;
		sum += tab[i];
	}
	
	if (sum < MOD)
	{
		processCaseWhenSumIsLessThanMod(tab,res,n);
		delete[] tab;
		delete[] sums;
		delete[] res;
		return 0;
	}

	res[0] = (tab[0] & 1) ? 0 : 1;
	for (int i=1;i<n;++i)
	{
		res[i] = (sums[i+1] & 1) ? 0 : 1;
		for (int j=0;j<i;++j)
		{
			int s = sums[i+1]-sums[j+1];
			if (s < 0) s += MOD;
			if (!(s & 1)) res[i] = (res[i] + res[j]) % MOD;
		}
	}
	
	cout << res[n-1] << endl;
	delete[] tab;
	delete[] sums;
	delete[] res;
	return 0;
}