Node* deleteNode(Node* head, int pos)
{
	if (pos == 0) return head->next;
	
	Node* prev = NULL;
	Node* set = head;
	while (pos > 0)
	{
    	prev = set;
    	set = set->next;
    	pos--;
	}
	
  	prev->next = set->next;
  	return head;
}