/******************************************************************************

                            Online C Compiler.
                Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <stdio.h>
#include <stdlib.h>

struct El {
    int info;
    struct El *next;
};

typedef struct El ElementoLista;



ElementoLista* readList(ElementoLista **lista, int dis){
    ElementoLista* head;
    ElementoLista* aux= *lista;
    ElementoLista* elAdd;
    int now;
    int last;

    scanf("%d", &now);
    if (dis>=0 && aux==NULL) {
        aux = malloc(sizeof(ElementoLista));
        head = aux;
    }
    last = now;

    while(abs(now-last)<=dis){
        last = now;
        aux->info = last;
        scanf("%d", &now);
        if(abs(now-last)<=dis){
            elAdd = malloc(sizeof(ElementoLista));
            aux->next = elAdd;
            aux=aux->next;
        }
    }

    aux->next=NULL;

    return head;

};


int maxDistance(ElementoLista *lista){
    int new = lista->info;
    int old = lista->info;
    int max;
    while(lista != NULL){
        if(abs(new-old)>max){
            max=abs(new-old);
        }
        old=new;
        lista = lista->next;
        if(lista!=NULL){
            new=lista->info;
        }
    }

    return max;
};


ElementoLista* CancellaMax(ElementoLista **lista, int maxdis){
    ElementoLista* head = *lista;
    ElementoLista* x = head;
    ElementoLista* succ = x->next;
    ElementoLista* prec;
    ElementoLista* canc;

    while(succ!=NULL){
        if(abs((x->info)-(succ->info))==maxdis){
            if(x == head){      // L'elemento da cancellare è il primo della lista //
                    x = x->next;
                    canc = head;
                    head = x;
                    succ = succ->next;
                    free(canc);
                }else{
                    prec->next=succ;
                    canc = x;
                    x = x -> next;
                    succ = succ->next;
                    free(canc);
                }
            }else{
                prec=x;
                x = x->next;
                succ = succ->next;
            }
        }

    return head;
};


void printList(ElementoLista *list){
    printf("(");
    fflush(stdout);
    while (list != NULL){
        printf("%d ", list->info);
        fflush(stdout);
        list = list->next;
    }
    printf(")\n");
    fflush(stdout);
}



int main(){
    ElementoLista *list = NULL;
    ElementoLista *list_aux = NULL;
    int boundis;
    int maxdis;

    scanf("%d", &boundis);

    list_aux = readList(&list, boundis);

    printf("La lista bounded-%d e':\n", boundis);
    fflush(stdout);

    if(list_aux != NULL){
        list = list_aux;
        list_aux = NULL;
    }

    printList(list);

    maxdis = maxDistance(list);
    printf("La distanza massima e':\n%d\n", maxdis);
    fflush(stdout);

    list_aux = CancellaMax(&list, maxdis);
    printf("La lista modificata e':\n");
    fflush(stdout);
    if (list_aux!= NULL){
        list = list_aux;
    }
    printList(list);

    return 0;
}