Problem:
Score : 200 points

Problem Statement

We will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \leq 1 holds for all i (1 \leq i \leq N).

In particular, any integer sequence is similar to itself.

You are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.

How many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?

Constraints

1 \leq N \leq 10

1 \leq A_i \leq 100

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the number of integer sequences that satisfy the condition.

Sample Input 1

2
2 3

Sample Output 1

7

There are seven integer sequences that satisfy the condition:

1, 2

1, 4

2, 2

2, 3

2, 4

3, 2

3, 4

Sample Input 2

3
3 3 3

Sample Output 2

26

Sample Input 3

1
100

Sample Output 3

1

Sample Input 4

10
90 52 56 71 44 8 13 30 57 84

Sample Output 4

58921

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <math.h>

int main(void){
	int N;
	scanf("%d", &N);
	int a[10];
	for(int i=0; i<N; i++){
		scanf("%d", a+i);
	}

	int num=0; // にている列の数
	int odd=0, even=0; // a内の偶数、奇数の数
	int extra=1; // 似ている列のうち積が奇数のもの

	num = (int) pow(3.0, N);

	for(int i=0; i<N; i++){
		if(a[i]%2==0){
			even++;
		}
		else{
			odd++;
		}
	}

	extra = (int) (pow(1.0, odd) * pow(2.0, even));

	/*for(int i=0; i<N; i++){
		printf("%d\n", a[i]);
	}
	printf("%d %d %d\n", num, odd, even);*/

	printf("%d\n", num-extra);
	return 0;
}