#include<stdio.h>
#include<stdlib.h>
struct node{
    int data;
    struct node*next;
}*head=NULL,*tail;
int main()
{
    int k,n;
    scanf("%d",&k);
    if((n-k)==0)
    {
        printf("List is empty");
    }
    else if(1<=n<=1000||0<=k<=n)
    {
        struct node*temp=head;
        for(int i=0;i<n-k-1;i++)
        {
            temp=temp->next;
        }
        struct node*t=temp;
        temp=temp->next;
        while(temp)
        {
            struct node*x=temp;
            temp=temp->next;
            free(x);
        }
        t->next=NULL;
        while(head)
        {
            printf("%d",head->data);
            head=head->next;
        }
    }
    else(k>n)
    {
        printf("Invalid input");
    }
    return 0;
}
}