import java.lang.*;

class LinkedList {
    Node head;

    // Node Class
    class Node{
        int data;
        Node next;

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

    }

    public void deleteNthNode(int n)
    {
        int len = calcLen(head);

        // Can only insert after 1st position
        // Can't insert if position to insert is greater than size of Linked List
        if(n < 1 || n > len)
        {
            System.out.println("Can't delete\n");

        }
        else
        {
            if(n == 1)
            {
                // head has to be deleted
                System.out.println("Deleted: " + head.data);
                head = head.next;
                return;
            }
            // required to traverse
            Node temp = head;
            Node previous = null;

            // traverse to the nth node
            while(--n > 0) {
                previous = temp;
                temp = temp.next;
            }
            // assigned next node of the previous node to nth node's next
            previous.next = temp.next;
            System.out.println("Deleted: " + temp.data);
        }
    }
    public void insert(int data)
    {
        Node newNode = new Node(data);
        newNode.next = head;
        head = newNode;
    }

    public void showList()
    {
        Node temp = head;
        //as linked list will end when Node reaches Null
        while(temp!=null)
        {
            System.out.print(temp.data + " ");
            temp = temp.next;
        }
        System.out.println("\n");
    }

    public int calcLen(Node temp){
        int len = 0;

        while(temp!=null){
            temp = temp.next;
            len++;
        }
        return len;
    }
}

public class Main
{
    public static void main(String args[])
    {
        LinkedList ll = new LinkedList();

        ll.insert(35);
        ll.insert(34);
        ll.insert(33);
        ll.insert(32);
        ll.insert(31);
        ll.insert(30);

        ll.showList();

        ll.deleteNthNode(3);
        ll.deleteNthNode(4);
        ll.showList();
    }
}

import java.lang.*;

// Node Class
class Node {
    int data;
    Node next;

    Node(int x) // parameterized constructor
    {
        data = x;
        next = null;
    }
}

class Main
{


    static Node deleteNthNode(int n, Node head) {
        int len = calcLen(head);

        // Can only insert after 1st position
        // Can't insert if position to insert is greater than size of Linked List
        if(n < 1 || n > len)
            System.out.println("Can't delete\n");

        else
        {
            if(n == 1)
            {
                // head has to be deleted
                System.out.println("Deleted: " + head.data);
                head = head.next;
                return head;
            }
            // required to traverse
            Node temp = head;
            Node previous = null;

            // traverse to the nth node
            while(--n > 0) {
                previous = temp;
                temp = temp.next;
            }
            // assigned next node of the previous node to nth node's next
            previous.next = temp.next;
            System.out.println("Deleted: " + temp.data);
        }
        return head;
    }
    public static Node insert(Node head, int data)
    {
        Node newNode = new Node(data);
        newNode.next = head;
        head = newNode;

        return head;
    }
    static void showList(Node temp) {

        //as linked list will end when Node is Null
        while (temp != null) {
            System.out.print(temp.data + " ");
            temp = temp.next;
        }
        System.out.println("\n");
    }

    static int calcLen(Node node){
        int len = 0;

        while(node!=null)
        {
            node = node.next;
            len++;
        }
        return len;
    }

    public static void main(String args[])
    {
        Node head = null;

        head = insert(head, 35);
        head = insert(head, 34);
        head = insert(head, 33);
        head = insert(head, 32);
        head = insert(head, 31);
        head = insert(head, 30);
        showList(head);


        head = deleteNthNode( 3, head);
        head = deleteNthNode( 4, head);
        showList(head);

    }
}