import java.io.InputStream; import java.io.InputStreamReader; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.Deque; import java.util.HashMap; import java.util.InputMismatchException; import java.util.Map; import java.util.PriorityQueue; import java.util.StringTokenizer; import java.math.BigInteger; public class Main{ static final InputStream in=System.in; static final PrintWriter out=new PrintWriter(System.out); static final int INF=Integer.MAX_VALUE/2; static final long LINF=Long.MAX_VALUE/2; public static void main(String[] args) throws IOException{ InputReader ir=new InputReader(in); int nw=ir.nextInt(); int res,insertionIndex; int[] w=ir.toIntArray(nw); int nb=ir.nextInt(); int[] b=ir.toIntArray(nb); Arrays.sort(w); Arrays.sort(b); int ans1,ans2; ans1=ans2=1; int prev=w[nw-1]; while(true){ res=Arrays.binarySearch(b,prev); insertionIndex=(res>=0)?res:~res; if(insertionIndex==0||b[0]==b[insertionIndex]) break; prev=b[insertionIndex-1]; ans1++; res=Arrays.binarySearch(w,prev); insertionIndex=(res>=0)?res:~res; if(insertionIndex==0||w[0]==w[insertionIndex]) break; prev=w[insertionIndex-1]; ans1++; } prev=b[nb-1]; while(true){ res=Arrays.binarySearch(w,prev); insertionIndex=(res>=0)?res:~res; if(insertionIndex==0||w[0]==w[insertionIndex]) break; prev=w[insertionIndex-1]; ans2++; res=Arrays.binarySearch(b,prev); insertionIndex=(res>=0)?res:~res; if(insertionIndex==0||b[0]==b[insertionIndex]) break; prev=b[insertionIndex-1]; ans2++; } out.println(Math.max(ans1,ans2)); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in;} public int readByte() { if(lenbuf==-1) throw new InputMismatchException(); if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return -1; } return buffer[curbuf++]; } public boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private int skip() {int b; while((b = readByte())!=-1&&isSpaceChar(b)); return b;} public String next() { int b=skip(); StringBuilder sb=new StringBuilder(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public int[] toIntArray(int n){ int[] a=new int[n]; for(int i=0;i