int start = _first->_entry;
	int count = 0;
	int tempCount = 0;
	Node * ptr = _first;
	// while (ptr != nullptr)
	//{
		//Asize++;
		//ptr = ptr->_next;
	//}
	//while (ptr2 != nullptr)
	//{
		//Bsize++;
		//ptr2 = ptr2->_next;
	//}
	while (ptr != nullptr)
	{
		Node * ptr2 = other._first;
		while (ptr2 != nullptr)
		{
			Node * countptr = ptr;
			Node * countptr2 = ptr2;
			while (countptr != nullptr && countptr2 != nullptr && countptr->_entry == countptr2->_entry)
			{
				tempCount++;
				// cout << "Countptr: " << countptr->_entry << endl;
				// cout << "Countptr2: " << countptr2->_entry << endl;
				countptr = countptr->_next;
				countptr2 = countptr2->_next;
			}
			if (tempCount > count)
			{
				count = tempCount;
			}
			tempCount = 0;
			ptr2 = ptr2->_next;
		}
		ptr = ptr->_next;
	}
	// cout << "A size: " << Asize << endl;
	// cout << "B size: " << Bsize << endl;
	// cout << "Hi Count Here: " << count << endl;
	return count;