#include<bits/stdc++.h>

using namespace std;

#define debug(n) cerr << #n << ':' << n << endl;
#define dline    cerr << __LINE__ << endl;

using ll = long long;
template<class T, class U> using P = pair<T,U>;
template<class T> using Heap = priority_queue<T>;
template<class T> using heaP = priority_queue<T,vector<T>,greater<T>>;
template<class T,class U> using umap = unordered_map<T,U>;
template<class T> using uset = unordered_set<T>;

template<class T>
bool ChangeMax(T&a,const T&b){
  if(a >= b) return false;
  a = b;    return true;
}

template<class T>
bool ChangeMin(T&a,const T&b){
  if(a <= b) return false;
  a = b;    return true;  
}

template<class T, size_t N, class U>
void Fill(T (&a)[N], const U&v){
    fill((U*)a,(U*)(a+N),v);
}

template<class T>
istream& operator >> (istream&is, vector<T>&v){
  for(auto&e:v)is >> e;
  return is;
}

template<long long mod>
class modint{
private:
  long long num;
  long long extgcd(long long a, long long b, long long&x, long long&y)const {
    long long d = a;
    if(b != 0){d = extgcd(b, a%b, y, x);  y -= (a/b) * x;}
    else{x = 1; y = 0;}
    return d;
  }
  long long modinverse()const{
    long long x, y;
    extgcd(num, mod, x, y);
    return (mod + x%mod)%mod;
  }
public:
  modint():num(0){}
  modint(const long long x):num((x < 0?(x+mod):x)%mod ){}
  friend modint operator+(const modint&a, const modint&b)
  {    return modint(a.num + b.num);  }
  friend modint operator-(const modint&a, const modint&b)
  {    return modint(a.num - b.num);  }
  friend modint operator*(const modint&a, const modint&b)
  {    return modint(a.num * b.num);  }
  friend modint operator/(const modint&a, const modint&b)
  {    return modint(a*b.modinverse());  }
  modint& operator+=(const modint&b)
  {    return (*this) = (*this) + b;  }
  modint& operator-=(const modint&b)
  {    return (*this) = (*this) - b;  }
  modint& operator*=(const modint&b)
  {    return (*this) = (*this) * b;  }
  modint& operator/=(const modint&b)
  {    return (*this) = (*this) / b;  }
  modint& operator++()
  {    (*this)+=1; return (*this);  }
  modint& operator--()
  {    (*this)-=1; return (*this);  }
  modint operator++(int){
    modint tmp(*this);
    ++(*this);
    return tmp;
  }
  modint operator--(int){
    modint tmp(*this);
    --(*this);
    return tmp;
  }    
  modint pow(unsigned long long i){
    if(i == 0) return 1;
    if(i & 1){
      return (*this) * (this->pow(i-1));
    }
    modint<mod>hpow = (this->pow(i>>1));
    return hpow * hpow;
  }
  friend ostream& operator<<(ostream&os, const modint&a){
    os << a.num;
    return os;
  }
  friend istream& operator>>(istream&is, modint&a){
    long long x; is >> x;
    a = x;
    return is;
  }
};

using mint = modint<1000000007>;

int n;
vector<int> v;

mint Rec(int r,int g,int b,int i){
  static map<tuple<int,int,int,int>,mint> mp;
  if(i == n)return 1;
  if(r > g)swap(r,g);
  if(g > b)swap(g,b);
  if(r > g)swap(r,g);
  if(mp.find({r,g,b,i}) != mp.end())return mp[{r,g,b,i}];
  int x = (r==v[i])+(g==v[i])+(b==v[i]);
  if(x == 1){
    if(r == v[i]) return mp[{r,g,b,i}] = Rec(r+1,g,b,i+1);
    if(g == v[i]) return mp[{r,g,b,i}] = Rec(r,g+1,b,i+1);    
    if(b == v[i]) return mp[{r,g,b,i}] = Rec(r,g,b+1,i+1);
  } else if(x == 2){
    if(r != v[i]) return mp[{r,g,b,i}] = Rec(r,g+1,b,i+1)*2;
    if(g != v[i]) return mp[{r,g,b,i}] = Rec(r+1,g,b,i+1)*2;
    if(b != v[i]) return mp[{r,g,b,i}] = Rec(r+1,g,b,i+1)*2;
  } else if(x == 3){
    return mp[{r,g,b,i}] = Rec(r+1,g,b,i+1)*3;
  }
  return mp[{r,g,b,i}] = 0;
}

int main(){
  cin >> n;
  v.resize(n);
  cin >> v;
  cout << Rec(0,0,0,0) << endl;
  return 0;  
}


Measured memory_bytes: 20828