void Stack<T>::Delete() {
	Node *current= head, *prev= head, *next_= head;

	while(head && head->value % 2 == 0) {
		pop();
	}

	size_t counter = 0;
	for (size_t i = 0; i <= size_-1; i++)
	{
		if ((current->value) % 2 == 0)
		{
			if (current->next == nullptr)
			{

				delete current;
				counter++;
				current = prev; next_ = nullptr;
				prev->next = nullptr;
				break;
			}


			next_ = current->next;
			delete current;
			counter++;
			prev->next = next_;
			current = prev->next;
		}
		else {

			if (next_ == nullptr)
				break;
			if (next_->next == nullptr) {
				current = next_;
				prev = current;
				current->next = nullptr;
				break;
			}
			prev = current;
			current = current->next;
			next_ = current->next;
		}
	}

	size_ = size_ - counter;
}