#include<bits/stdc++.h> using namespace std; const int N=3e4+10; int n,m; int s[N],g[N]; int res; bool cmp(int x,int y){ return x>y; } int main(){ scanf("%d",&m); for(int i=1;i<=m;i++){ scanf("%d",&g[i]); } scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&s[i]); } sort(s+1,s+n+1,cmp); sort(g+1,g+m+1,cmp); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(g[j]==-1){ continue; } //printf("%d %d %d\n",res,g[j],s[i]); if(s[i]>=g[j]){ g[j]=-1; res++; break; } } } printf("%d\n",res); return 0; }