Stack using Linked List in DSA Java

Program 1

package dataflair;
import java.util.*;
public class TestStack 
{
    public static void main(String[] args) 
    {
        int n,choice=0;
        Scanner scan=new Scanner(System.in);
        LinkedList<Integer>mystack=new LinkedList<Integer>();
      do
      {     
        System.out.println("\n----------------Stack Menu---------------------------");
        System.out.println("1.Push");
        System.out.println("2.Pop");
        System.out.println("3.Display");
        System.out.println("4.Search");
        System.out.println("5.Exit");
        System.out.println("\n--------------------------------------------------------");
        System.out.println("\nEnter Your Choice");    
        choice=scan.nextInt();
        switch(choice)
        {
            case 1:
            {
                System.out.println("Enter an element for push");  
                n=scan.nextInt();
                mystack.push(n);
                break;
            }
            case 2:
            {
                  //pop
                if(mystack.isEmpty())
                    System.out.println("Stack is empty...........");
                else
                {
                    System.out.println("Poped element is "+mystack.pop());
                }    
                break;
            }
            case 3:
                //display
                System.out.println("Elements of Stack:\n");
                for(Integer I:mystack)
                    System.out.print("  "+I);
                break;
            case 4:
            {
                //search
                if(mystack.isEmpty())
                    System.out.println("Stack is empty...........");
                else
                {     
                 System.out.println("Enter an element for search");  
                 n=scan.nextInt();
                 if(mystack.contains(n))
                        System.out.println("Searching success");
                 else
                       System.out.println("Searching not success"); 
                }
            }
            case 5:break;    
            default:System.out.println("Invalid choice");
        }   
      }while(choice!=5);
    }
    
}