import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto K = new int[N];
      foreach (i; 0 .. N) {
        K[i] = readInt;
      }
      auto T = new int[N];
      auto A = new int[][N];
      foreach (j; 0 .. N) {
        T[j] = readInt;
        A[j] = new int[T[j]];
        foreach (t; 0 .. T[j]) {
          A[j][t] = readInt;
        }
      }
      
      bool check(int thr) {
        auto bs0 = new RedBlackTree!(int, "a < b", true);
        auto bs1 = new RedBlackTree!(int, "a < b", true);
        foreach (j; 0 .. N) {
          const b = cast(int)(A[j].count!(a => (a >= thr)));
          ((b < T[j]) ? bs0 : bs1).insert(b);
        }
        debug {
          writeln(thr, ": ", bs0, " ", bs1);
        }
        int bad;
        int mx = -1;
        foreach_reverse (i; 0 .. N) {
          if (mx >= K[i]) {
            if (bad + 1 <= cast(int)(bs1.length)) {
              return true;
            }
          }
          auto ran0 = bs0.upperBound(K[i] - 1);
          auto ran1 = bs1.upperBound(K[i] - 1);
          if (!ran0.empty) {
            if (bad <= cast(int)(bs1.length)) {
              return true;
            }
          } else if (!ran1.empty) {
            if (bad + 1 <= cast(int)(bs1.length)) {
              return true;
            }
          } else {
            ran0 = bs0.upperBound(K[i] - 1 - 1);
            if (!ran0.empty) {
              chmax(mx, ran0.front);
              bs0.removeKey(ran0.front);
            } else {
              ++bad;
            }
          }
        }
        return false;
      }
      
      int[] as;
      foreach (j; 0 .. N) {
        as ~= A[j];
      }
      as = as.sort.uniq.array;
      int lo = 0, hi = cast(int)(as.length);
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        (check(as[mid]) ? lo : hi) = mid;
      }
      writeln(as[lo]);
    }
  } catch (EOFException e) {
  }
}