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.

Examples

Input

2
2 3


Output

7


Input

3
3 3 3


Output

26


Input

1
100


Output

1


Input

10
90 52 56 71 44 8 13 30 57 84


Output

58921
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.SplittableRandom;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
 
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * 
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }
 
    static class TaskB
    {
        public void solve(int testNumber, FastReader in, PrintWriter out) 
        {
        	
        	int n=in.nextInt();
        	int resEven=0;
        	int resOdd=1;
        	for(int i=0;i<n;i++)
        	{
        		int x=in.nextInt();
    			if (x % 2 == 0) {
    				resEven = resOdd + resEven * 3;
    				resOdd *= 2;
    			} else {
    				resEven = resOdd * 2 + resEven * 3;
    				resOdd *= 1;
    			}
        	}
        	
        	out.println(resEven);
            
        }
    }
 
 
 
    static class FastReader
    {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int pnumChars;
        private FastReader.SpaceCharFilter filter;
 
        public FastReader(InputStream stream)
        {
            this.stream = stream;
        }
 
        private int pread() 
        {
            if (pnumChars == -1)
            {
                throw new InputMismatchException();
            }
            if (curChar >= pnumChars)
            {
                curChar = 0;
                try
                {
                    pnumChars = stream.read(buf);
                } catch (IOException e) 
                {
                    throw new InputMismatchException();
                }
                if (pnumChars <= 0)
                {
                    return -1;
                }
            }
            return buf[curChar++];
        }
 
        public int nextInt()
        {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = pread();
            }
            int res = 0;
            do
            {
                if (c == ',')
                {
                    c = pread();
                }
                if (c < '0' || c > '9')
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = pread();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString()
        {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            StringBuilder res = new StringBuilder();
            do 
	{
                res.appendCodePoint(c);
                c = pread();
                } while (!isSpaceChar(c));
            return res.toString();
        }
 
        public long nextLong()
        {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = pread();
            }
            long res = 0;
            do
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = pread();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public long[] nextLongArray(int n)
        {
            long[] array = new long[n];
            for (int i = 0; i < n; i++)
            {
                array[i] = nextLong();
            }
            return array;
        }
 
        private boolean isSpaceChar(int c)
        {
            if (filter != null)
            {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }
 
        private static boolean isWhitespace(int c) 
        {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
 
        private interface SpaceCharFilter
        {
            public boolean isSpaceChar(int ch);
 
        }
 
    }
}