if (Empty() == false)
	{
		if(first->next!=nullptr)
		{
			node *p;
			p = first;
			first = p->next;
			first->pred = nullptr;
			delete(p);
		}
		else
		{
			delete first;
			first = nullptr;
		}
		size--;
	}
	else
		cout << "List is empty" << endl;