int main()
{
	int a[1111],b[1111],m[1110]={0},n,w,max=0,j,i=-1;
	char c=',';
	while (c==',')
	{
		i++;
		scanf("%d",&a[i]);
		c=getchar();
	}
	w=i+1;
	c=',';
	i=-1;
	while (c==',')
	{
		i++;
		scanf("%d",&b[i]);
		c=getchar();
	}	
	for (n=0;n<=999;n++)
	{
		for (j=0;j<=i;j++)
		{
			if ((n>=a[j])&&(n<b[j]))
				m[n]++;
		}
	}
	for (n=0;n<=999;n++)
	{
		if (m[n]>max)
			max=m[n];
	}
	printf("%d ",w);
	printf("%d\n",max);
}
	
