import java.util.Scanner;

public class SinglyLinkedList {
    
    // Node class
    static class Node {
        int data;
        Node next;
        
        Node(int data) {
            this.data = data;
            this.next = null;
        }
    }
    
    // Head of the linked list
    Node head;
    
    // Method to add a node to the end of the list
    public void add(int data) {
        Node newNode = new Node(data);
        if (head == null) {
            head = newNode;
        } else {
            Node current = head;
            while (current.next != null) {
                current = current.next;
            }
            current.next = newNode;
        }
    }
    
    // Method to delete a node from the middle of the list
    public void deleteMiddle(int position) {
        if (head == null) {
            return;
        }
        Node current = head;
        if (position == 1) {
            head = current.next;
            return;
        }
        for (int i = 1; current != null && i < position - 1; i++) {
            current = current.next;
        }
        if (current == null || current.next == null) {
            return;
        }
        current.next = current.next.next;
    }
    
    // Method to display the list
    public void display() {
        Node current = head;
        while (current != null) {
            System.out.print(current.data + " ");
            current = current.next;
        }
    }
    
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        SinglyLinkedList list = new SinglyLinkedList();
        System.out.print("Enter the number of nodes: ");
        int n = input.nextInt();
        for (int i = 1; i <= n; i++) {
            System.out.print("Enter the data for node " + i + ": ");
            int data = input.nextInt();
            list.add(data);
        }
        System.out.println("The linked list is: ");
        list.display();
        System.out.print("\nEnter the position of the node to delete: ");
        int position = input.nextInt();
        list.deleteMiddle(position);
        System.out.println("\nThe linked list after deleting the node at position " + position + " is: ");
        list.display();
    }
    
}

Enter the number of nodes: 5
Enter the data for node 1: 4
Enter the data for node 2: 9
Enter the data for node 3: 6
Enter the data for node 4: 10
Enter the data for node 5: 19
The linked list is: 4 9 6 10 19 
Enter the position of the node to delete: 4
The linked list after deleting the node at position 4 is: 4 9 6 19