output_description: Print the number of integer sequences that satisfy the condition.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: # coding: utf-8
  import re
  import math
  from collections import defaultdict
  from collections import deque
  import itertools
  from copy import deepcopy
  import random
  import time
  import os
  import queue
  import sys
  import datetime
  from functools import lru_cache
  
  # @lru_cache(maxsize=None)
  readline = sys.stdin.readline
  sys.setrecursionlimit(2000000)
  # import numpy as np
  alphabet = "abcdefghijklmnopqrstuvwxyz"
  mod = int(10**9 + 7)
  inf = int(10**20)
  
  
  def yn(b):
      if b:
          print("yes")
      else:
          print("no")
  
  
  def Yn(b):
      if b:
          print("Yes")
      else:
          print("No")
  
  
  def YN(b):
      if b:
          print("YES")
      else:
          print("NO")
  
  
  class union_find:
      def __init__(self, n):
          self.n = n
          self.P = [a for a in range(N)]
          self.rank = [0] * n
  
      def find(self, x):
          if x != self.P[x]:
              self.P[x] = self.find(self.P[x])
          return self.P[x]
  
      def same(self, x, y):
          return self.find(x) == self.find(y)
  
      def link(self, x, y):
          if self.rank[x] < self.rank[y]:
              self.P[x] = y
          elif self.rank[y] < self.rank[x]:
              self.P[y] = x
          else:
              self.P[x] = y
              self.rank[y] += 1
  
      def unite(self, x, y):
          self.link(self.find(x), self.find(y))
  
      def size(self):
          S = set()
          for a in range(self.n):
              S.add(self.find(a))
          return len(S)
  
  
  def is_pow(a, b):  # aはbの累乗数か
      now = b
      while now < a:
          now *= b
      if now == a:
          return True
      else:
          return False
  
  
  def bin_(num, size):
      A = [0] * size
      for a in range(size):
          if (num >> (size - a - 1)) & 1 == 1:
              A[a] = 1
          else:
              A[a] = 0
      return A
  
  
  def get_facs(n, mod_=0):
      A = [1] * (n + 1)
      for a in range(2, len(A)):
          A[a] = A[a - 1] * a
          if mod_ > 0:
              A[a] %= mod_
      return A
  
  
  def comb(n, r, mod, fac):
      if n - r < 0:
          return 0
      return (fac[n] * pow(fac[n - r], mod - 2, mod) * pow(fac[r], mod - 2, mod)) % mod
  
  
  def next_comb(num, size):
      x = num & (-num)
      y = num + x
      z = num & (~y)
      z //= x
      z = z >> 1
      num = y | z
      if num >= (1 << size):
          return False
      else:
          return num
  
  
  def get_primes(n, type="int"):
      if n == 0:
          if type == "int":
              return []
          else:
              return [False]
      A = [True] * (n + 1)
      A[0] = False
      A[1] = False
      for a in range(2, n + 1):
          if A[a]:
              for b in range(a * 2, n + 1, a):
                  A[b] = False
      if type == "bool":
          return A
      B = []
      for a in range(n + 1):
          if A[a]:
              B.append(a)
      return B
  
  
  def is_prime(num):
      if num <= 1:
          return False
      i = 2
      while i * i <= num:
          if num % i == 0:
              return False
          i += 1
      return True
  
  
  def ifelse(a, b, c):
      if a:
          return b
      else:
          return c
  
  
  def join(A, c=""):
      n = len(A)
      A = list(map(str, A))
      s = ""
      for a in range(n):
          s += A[a]
          if a < n - 1:
              s += c
      return s
  
  
  def factorize(n, type_="dict"):
      b = 2
      list_ = []
      while b * b <= n:
          while n % b == 0:
              n //= b
              list_.append(b)
          b += 1
      if n > 1:
          list_.append(n)
      if type_ == "dict":
          dic = {}
          for a in list_:
              if a in dic:
                  dic[a] += 1
              else:
                  dic[a] = 1
          return dic
      elif type_ == "list":
          return list_
      else:
          return None
  
  
  def floor_(n, x=1):
      return x * (n // x)
  
  
  def ceil_(n, x=1):
      return x * ((n + x - 1) // x)
      return ret
  
  
  def seifu(x):
      return x // abs(x)
  
  
  ######################################################################################################
  def main():
      n = int(input())
      A = list(map(int, input().split()))
      ans = 3**n
      mi = 1
      for a in A:
          if a % 2 == 0:
              mi *= 2
          else:
              mi *= 1
      ans -= mi
      print(ans)
  
  
  main()
  
problem_description: 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?
samples: [{"input": "2\n    2 3", "output": "7\n    \n\nThere are seven integer sequences that satisfy the condition:\n\n  * 1, 2\n  * 1, 4\n  * 2, 2\n  * 2, 3\n  * 2, 4\n  * 3, 2\n  * 3, 4\n\n* * *"}, {"input": "3\n    3 3 3", "output": "26\n    \n\n* * *"}, {"input": "1\n    100", "output": "1\n    \n\n* * *"}, {"input": "10\n    90 52 56 71 44 8 13 30 57 84", "output": "58921"}]