int count(node*& H)
{
	node *p = H;
	int n = 0;
	while (p!=NULL)
	{
		n++;
		p = p->next; //tu mi blad pokazuje 
	}
	return n;
}