Queue using Linked List

LinkedQueue.java

import java.util.Scanner;

class Node {
    Node next;
    int value;

    Node (int value) {
        this.value = value;
    }
}

public class LinkedQueue {
    private Node front = null;
    private Node rear = null;

    public void enQueue(int value) {
        Node newNode = new Node(value);

        if (isEmpty()) {
            front = rear = newNode;
        } else {
            rear.next = newNode;
            rear = newNode;
        }
    }

    public void deQueue() {
        if (isEmpty()) {
            System.out.println("Queue is empty.");
            return;
        } else {
            front = front.next;
            if (front == null)
                rear = null;
        }
    }

    public void peek() {
        if (isEmpty()) {
            System.out.println("Queue is empty.");
            return;
        } else {
            System.out.println(front.value);
        }
    }

    public void print() {
        System.out.println();
        Node temp = front;
        while (temp != null) {
            System.out.println(temp.value);
            temp = temp.next;
        }
        System.out.println();
    }

    public boolean isEmpty() {
        return (front == null);
    }

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

        LinkedQueue myQ = new LinkedQueue();
        myQ.deQueue();

        for (int i=0; i<5; i++) {
            myQ.enQueue(read.nextInt());
        }

        myQ.peek();
        myQ.print();
        myQ.deQueue();
        myQ.print();

        for (int i=0; i<5; i++) {
            myQ.deQueue();
        }

        myQ.enQueue(1);
        myQ.enQueue(2);

        myQ.print();
    }
}