// editor3
#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
      {
          struct node*temp=head;
          for(i=0;i<n-k;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
          }
      }
  }