void deleteFirst(node *&H)
{
    if(H!= nullptr)
    {
        node *p=H;
        H=H->next;
        delete p;
    }
}

void deleteSecond(node *&before)
{
    if(before!= nullptr&&before->next!= nullptr){

        node *p=before->next;
        before->next=before->next->next;
        delete p;
    }

}



void zadanie3(node *&head)
{
    if(head!= nullptr)
    {
        node* p=head;
        while(p&&p->next)
        {
            if(p->value==p->next->value)
            {
                deleteSecond(p);
            }
            p=p->next;
        }
    }

}

int findMax(node *head)
{
    int wartosc=head->value;
    node *p=head;
    while(p)
    {
        if(wartosc<p->value)
        {
            wartosc=p->value;
        }
        p=p->next;
    }
    return wartosc;
}

void zadanie1(node *&head)
{
    if(head!= nullptr)
    {
        node *p=head;
        int max= findMax(head);
        while(p->next->value!=max)
        {
            p=p->next;

        }
        deleteSecond(p);
    }
}