def findMaxDropPoints$($x$\_$coordinates, y$\_$coordinates$)$:

# Create dictionaries to store the count of x and y coordinates

x$\_$count $=\{\}$

y$\_$count $=\{\}$

# Iterate through the x$\_$coordinates and count their occurrences

for x in x$\_$coordinates:

if x in x$\_$count:

x$\_$count$[$x$]+=1$

else:

x$\_$count$[$x$]=1$

# Iterate through the y$\_$coordinates and count their occurrences

for y in y$\_$coordinates:

if y in y$\_$count:

y$\_$count$[$y$]+=1$

else:

y$\_$count$[$y$]=1$

# Find the maximum occurrences for x and y coordinates

max$\_$x$\_$occurrences $=$ max$($x$\_$count.values$())$

max$\_$y$\_$occurrences $=$ max$($y$\_$count.values$())$

# Calculate the maximum number of drop points

max$\_$drop$\_$points $=$ max$($max$\_$x$\_$occurrences, max$\_$y$\_$occurrences$)$

return max$\_$drop$\_$points

# Input

N $=$ int$($input$())$

x$\_$coordinates $=$ list$($map$($int$,$ input$().$split$()))$

M $=$ int$($input$())$

y$\_$coordinates $=$ list$($map$($int$,$ input$().$split$()))$

# Find and print the maximum number of drop points

result $=$ findMaxDropPoints$($x$\_$coordinates, y$\_$coordinates$)$

print$($result$)$