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: #include <iostream>
  #include <iomanip>
  #include <string>
  #include <stack>
  #include <vector>
  #include <math.h>
  #include <stdio.h>
  #include <algorithm>
  #include <utility>
  #include <functional>
  #include <map>
  #include <set>
  #include <queue>
  #include <list>
  #include <regex>
  using namespace std;
  using pii  = pair<int,int>;
  using ll=long long;
  using ld=long double;
  #define pb push_back
  #define mp make_pair
  #define sc second
  #define fr first
  #define stpr setprecision
  #define cYES cout<<"YES"<<endl
  #define cNO cout<<"NO"<<endl
  #define cYes cout<<"Yes"<<endl
  #define cNo cout<<"No"<<endl
  #define rep(i,n) for(ll i=0;i<(n);++i)
  #define Rep(i,a,b) for(ll i=(a);i<(b);++i)
  #define rrep(i,n) for(int i=n-1;i>=0;i--)
  #define rRep(i,a,b) for(int i=a;i>=b;i--)
  #define crep(i) for(char i='a';i<='z';++i)
  #define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
  #define ALL(x) (x).begin(),(x).end()
  #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
  #define endl '\n'
  int ctoi(const char c){
    if('0' <= c && c <= '9') return (c-'0');
    return -1;
  }
  ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
  ll lcm(ll a,ll b){return a*b/gcd(a,b);}
  constexpr ll MOD=1000000007;
  constexpr ll INF=1000000011;
  constexpr ll MOD2=998244353;
  constexpr ll LINF = 1001002003004005006ll;
  constexpr ld EPS=10e-8;
  template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
  template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
  template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
  template<class T> ostream& operator<<(ostream& os, vector<T>& v){
      for(auto i=begin(v); i != end(v); ++i){
          if(i !=begin(v)) os << ' ';
          os << *i;
      }
      return os;
  }
  
  ll ans,M[100007];
  
  ll compME(ll b, ll e, ll m){  // bのe乗のmod m を返す
      if (e == 0) return 1;
      ans = compME(b, e / 2, m);
      ans = (ans * ans) % m;
      if (e % 2 == 1) ans = (ans * b) % m;
      return ans;
  }
  
  int main(){
      ll N,A[100007],T=1,C=1;
      cin >> N;
      rep(i,N){
          cin >> A[i];
          if(A[i]%2==0){
              T*=2;
          }
          C*=3;
      }
      cout << C-T << endl;
  }
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"}]