#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
 
const int MOD = 1000000007;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
 
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
 
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
 
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)
 
ll MODPOW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = MODPOW(n, m / 2);
    return (tmp * tmp) % MOD;
  } else {
    return (n * MODPOW(n, m - 1)) % MOD;
  }
}
 
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl A(N);
  ll zero = 0;
  REP(i, N) {
    cin >> A[i];
    if (A[i] == 0)
      zero++;
  }
  vl DD(100005, 0);
  REP(i, N) {
    if (DD[A[i]] >= 3) {
      cout << 0 << endl;
      return 0;
    } else if (A[i] == 0) {
      DD[0]++;
    } else if (DD[A[i] - 1] > DD[A[i]]) {
      DD[A[i]]++;
    } else {
      cout << 0 << endl;
      return 0;
    }
  }
 
  if (zero == 1) {
    cout << 3 << endl;
    return 0;
  } else if (zero == 2) {
    vl DP(2, -1);
    ll ans = 1;
    REP(i, N) {
      ll d = 0;
      REP(c, 2) {
        if (DP[c] == A[i] - 1) {
          d++;
        }
      }
      REP(c, 2) {
        if (DP[c] == A[i] - 1) {
          DP[c]++;
          break;
        }
      }
      ans = (ans * d) % MOD;
    }
    cout << (ans*3)%MOD << endl;
    return 0;
  } else if (zero == 3) {
    vl DP(3, -1);
    ll ans = 1;
    REP(i, N) {
      ll d = 0;
      REP(c, 3) {
        if (DP[c] == A[i] - 1) {
          d++;
        }
      }
      REP(c, 3) {
        if (DP[c] == A[i] - 1) {
          DP[c]++;
          break;
        }
      }
      ans = (ans * d) % MOD;
    }
    cout << ans << endl;
    return 0;
  } else {
    cout << 0 << endl;
  }
  return 0;
}

Measured memory_bytes: 1792