// Program 54: Delete an Element at the Rear of a Linked List

import java.util.*;

class DeleteRear
{
    static class Node
    {
        int data;
        Node next;

        Node(int value)
        {
            data = value;
            next = null;
        }
    }

    Node head = null;

    void insertRear(int value)
    {
        Node fresh = new Node(value);

        if (head == null)
        {
            head = fresh;
        }
        else
        {
            Node ptr = head;

            while (ptr.next != null)
            {
                ptr = ptr.next;
            }

            ptr.next = fresh;
        }
    }

    void deleteRear()
    {
        if (head == null)
        {
            System.out.println("List is empty");
        }
        else if (head.next == null)
        {
            head = null;
        }
        else
        {
            Node ptr = head;

            while (ptr.next.next != null)
            {
                ptr = ptr.next;
            }

            ptr.next = null;
        }
    }

    void display()
    {
        Node ptr = head;

        System.out.println("Linked list:");
        while (ptr != null)
        {
            System.out.println(ptr.data);
            ptr = ptr.next;
        }
    }

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        DeleteRear list = new DeleteRear();

        System.out.print("Number of nodes: ");
        int n = sc.nextInt();

        for (int i = 1; i <= n; i++)
        {
            System.out.print("Enter data: ");
            list.insertRear(sc.nextInt());
        }

        list.deleteRear();
        list.display();
    }
}