import sys
from collections import deque
input = sys.stdin.readline

N = int(input())
K_rev = list(map(int, input().split()))[::-1]
T = [0] * N
A = [[] for _ in [0] * N]
st = set([])
for i in range(N):
	T[i] = int(input())
	A[i] = list(map(int, input().split()))
	st |= set(A[i])
Alis = sorted(st)

def check():
	P_tmp = [];	Q_tmp = []
	for lis in A:
		s = sum((k >= m) for k in lis)
		if(s < len(lis)):
			P_tmp.append(s)
		else:
			Q_tmp.append(s)
	P = deque(sorted(P_tmp))
	Q = deque(sorted(Q_tmp))
	for i, k in enumerate(K_rev):
		p = P[-1] if(P) else -1
		q = Q[-1] if(Q) else -1
		if(max(p, q) >= k):
			break
		elif(p == k - 1 and i < N - 1):
			P.pop()
		elif(q != -1):
			Q.popleft()
		else:
			return False
	return True

ok = 0
ng = len(Alis)
while(ng - ok > 1):
	t = (ok + ng) >> 1
	m = Alis[t]
	if check():
		ok = t
	else:
		ng = t

ans = Alis[ok]
print(ans)