import java.util.*;
public class lp
{
public int value;
public lp next;

public lp(int value, lp next)
{
this.next = next;
this.value = value;
}


//lp copy_except(lp head,int n,int counter)
//This function returns a copy of the list at "head" except for element "n", starting the count at "counter".
//To call it, set "head" to the input list, "n" to the element to be omitted, and counter to 0.

 
// Recursive Function
  //If the input list is empty, return null.
  //If not, call the function recursively with the rest of the list, n, and counter+1 as arguments.
  //If counter=n, return the result of the recursive call (omitting the n-th element of the list);
 //otherwise put the first element of the list in front of the list returned by the recursive call



  //helper method: write out the items of the linked list
    public static void write(lp node){
 
     if(node != null){
        System.out.print(node.value + "   ");
        write(node.next);
      } 
    }
     
public static void main(String[]args)
{
                                                         
   int n;
   // creates a Scanner
   Scanner sc = new Scanner(System.in);

   // Ask the user to delete the desired element.
   System.out.println("number of the element to delete:");
   n = sc.nextInt();

   // Prints out the answer acordding to the length of the list .
  if(n <= 9)
   {
   System.out.println("Result = " );
   }
  // Prints out an error message if input is out of bound
  else
  {
    System.out.println("Error Out of Bound");
   }
// Build the list here
lp list1 = new lp(1, new lp(2, new lp(3, new lp(4, new lp(5, new lp(6, new lp(7, new lp(8, new lp(9, null)))))))));
  System.out.print("list1 = ");
  lp.write(list1);     

}// end of main
}// end of class

public static  lp copyExcept(lp head,int n,int counter)
{
  //This function returns a copy of the list at "head" except for element "n", starting the count at "counter".
//To call it, set "head" to the input list, "n" to the element to be omitted, and counter to 0.
 
   counter = 0;
if (head != null | n <head.value)
{
  return new lp(n,head);
}
  else
  {
   head = head.next;
   head.next = copyExcept(head.next,n,counter);
   counter++;
   return head;

  }
}


  //If the input list is empty, return null.
  //If not, call the function recursively with the rest of the list, n, and counter+1 as arguments.
  //If counter=n, return the result of the recursive call (omitting the n-th element of the list);
 //otherwise put the first element of the list in front of the list returned by the recursive call

public  static int remove(lp head, int n, int counter)
{

if(head == null)
{
  return 0;
   
}
else
{
 return remove(head.next,n, counter+1);
 
}