Print ith index on Linked List node from scratch

import java.sql.SQLOutput;
import java.util.*;
public class ithIndexPrint {


    public static void print(Node<Integer> head, int i){

        while(head != null && i > 0){

            head = head.next;

            i--;

            if(i == 0){

                System.out.println(head.data);

            }

        }

    }

    public static Node<Integer> takeInput(){

        Scanner scan = new Scanner(System.in);
        Node<Integer> head = null;
        Node<Integer> tail = null;


        System.out.println("Enter Node:");
        int data = 0;
        while(data != -1){  //tab tak ham data lenge jab tk -1 na aa jaye

            data = scan.nextInt();   // loop me aane ke bad ham data input lenge

            Node<Integer> newData = new Node<Integer>(data);  // us data ka ek node banayenge

            if(head == null){   //agar head hamara blank hai to usme node ka data store kar do
                head = newData;     // head me node ka data store kar diya
                tail = newData;    // aur filhal tail bhi wahi bana diya

            }

            else{         // agar ek data aa chuka hai to next data ke liye yaha aaayenga

                tail.next = newData;    // tail ke next ko next data ka reference de denge
                tail = newData;  // tail me us next node ka data store kar denge

            }

        } return head;

    }


    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        Node<Integer> head = takeInput();

        int i = scan.nextInt();

        print(head,i);

    }

}