#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
const int N = 222;
int prv[4], cnt[4], q[4][1000010];
int adj[N][N], ind[N], out[N], tmp[N], c[N];
int main() {
  int n, ans = 0x3f3f3f3f;
  gn(n);
  for (int i = 0; i < n; i++) gn(c[i]), c[i]--;
  for (int i = 0; i < n; i++) {
    int m;
    gn(m);
    for (int j = 0; j < m; j++) {
      int u;
      gn(u);
      u--;
      adj[u][out[u]++] = i;
      ind[i]++;
    }
  }
  for (int st = 0; st < 3; st++) {
    memset(prv, 0, sizeof(prv));
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; i++) tmp[i] = ind[i];
    for (int i = 0; i < n; i++)
      if (!tmp[i]) q[c[i]][cnt[c[i]]++] = i;
    int tim = 0, ct = st, tot = n;
    while (true) {
      while (prv[ct] < cnt[ct]) {
        int u = q[ct][prv[ct]++];
        tim++;
        tot--;
        for (int i = 0; i < out[u]; i++) {
          int v = adj[u][i];
          tmp[v]--;
          if (!tmp[v]) q[c[v]][cnt[c[v]]++] = v;
        }
      }
      if (!tot) break;
      tim++;
      ct++;
      ct %= 3;
    }
    smin(ans, tim);
  }
  println(ans);
  return 0;
}
