import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
from collections import deque
n = ii()

k = li()[::-1]
a = []
for _ in range(n):
    _ = ii()
    a.append(list(sorted(li(), reverse=True)))
a.sort(key = len, reverse=True)

def check(x):   
    A = []
    B = []

    for i in range(n):
        cnt = 0
        for v in a[i]:
            if v >= x:
                cnt += 1
        if cnt == len(a[i]):
            B.append(cnt)
        else:
            A.append(cnt)
    A.sort()
    B.sort()
    A = deque(A)
    B = deque(B)
    for i, nk in enumerate(k):
        if A and A[-1] >= nk:
            return True
        elif B and B[-1] >= nk:
            return True
        elif A and A[-1] == nk - 1 and i + 1 != len(k):
            A.pop()
            continue
        elif B:
            B.popleft()
            if i + 1 < len(k):
                continue
            else:
                return True
        else:
            return False
    return False
A = []
for i in range(n):
    for v in a[i]:
        A.append(v)


A.sort()
ok = 0
ng = len(A)
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if check(A[mid]):
        ok = mid
    else:
        ng = mid
print(A[ok])