//**********************************************
//**????????****************************
//**?????? 1000012741*********************
//**???2010?11?26?************************
//**********************************************
int main()
{
	//n?????p?????????a?b???????????????
	int n, p, i = 1, j, a[1002], b[1002], count, max1 = 0;
	char c;                   //c??????
	do
	{	
		cin >> a[i];          //????????
		c = cin.get();
		i++;
	} while (c == ',');
	p = i - 1;                //??????
	i = 1;
	do
	{
		cin >> b[i];          //????????
		c = cin.get();
		i++;
	} while (c == ',');
	int max = 0, min = 1004;  //max?????????min????????
	for (i = 1; i <= p; i++)  //?????????
	{
		if (a[i] < min)
			min = a[i];
	}
	for (i = 1; i <= p; i++)  //?????????
	{
		if (b[i] > max)
			max = b[i];
	}
	for (i = min; i <= max; i++)  //???????????
	{
		count = 0;            //count?????????????
		for (j = 1; j <= p; j++)
		{
			if (a[j] <= i && b[j] >= (i + 1))
				count++;
		}
		if (count > max1)     //?????????
			max1 = count;
	}
	cout << p << " " << max1 << endl;  //??????????????????????
	return 0;
}
//**********************************************