a=2.times.map{gets;gets.split.map(&:to_i).sort}
p [0,1].map{|e|
c=a[e][0]
i=[0,0]
t=e^r=1
loop{i[t]+=1 while i[t]<a[t].size&&a[t][i[t]]<=c
break if i[t]==a[t].size
c=a[t][i[t]]
r+=1
t^=1
}
r}.max