/*
TASK:FOLDERS
LANG:C++
*/


#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
struct dodo{
	char name[10];
	int fold;
	int sek;
};
int used[2001];
dodo a[1000];
dodo b[1000];

int main()
{int i=0,j,sum=0,br=-1;
int sumb=0;

for(i=0;i<=201;i++){
	scanf("%s %d %d",&a[i].name,&a[i].fold,&a[i].sek);
	sum+=a[i].fold;
    br++;
	
    if(br==sum)break;
}

br=-1;

 for(i=0;i<=201;i++){
	scanf("%s %d %d",&b[i].name,&b[i].fold,&b[i].sek);
	sumb+=b[i].fold;
    br++;

	
	if(br==sumb)break;
 }
int flag=0;
 for(i=0;i<=sum;i++){
	 for(j=0;j<=sumb;j++){
		 if(strcmp(a[i].name,b[i].name) && !used[i]){
			 if(a[i].sek>b[i].sek){ 
				 flag++;

				 used[i]=1;

			 }
			 else if(a[i].fold>b[i].fold){
				 flag++;

					 used[i]=1;

				 
			 }
		 }
	 }
 }


	 printf("%d\n",flag-1);

 return 0;
}

