program in java using the Queue API

please note that the example input should deliver the output shown

all of operations on the queue is already in Queue API code which I submitted below like enqueue and dequeue and peek etc ...

Here is the Queue API that should be used

Here is the Queue API that should be used    import java.util.Iterator;  import java.util.NoSuchElementException;    public class Queue implements Iterable {      private int n;         // number of elements on queue      private Node first;    // beginning of queue      private Node last;     // end of queue        // helper linked list class      private class Node {          private Item item;          private Node next;      }        /**       * Initializes an empty queue.       */      public Queue() {          first = null;          last  = null;          n = 0;      }        /**       * Returns true if this queue is empty.       *       * @return {@code true} if this queue is empty; {@code false} otherwise       */      public boolean isEmpty() {          return first == null;      }        /**       * Returns the number of items in this queue.       *       * @return the number of items in this queue       */      public int size() {          return n;      }        /**       * Returns the number of items in this queue.       *       * @return the number of items in this queue       */      public int length() {          return n;      }        /**       * Returns the item least recently added to this queue.       *       * @return the item least recently added to this queue       * @throws NoSuchElementException if this queue is empty       */      public Item peek() {          if (isEmpty()) throw new NoSuchElementException("Queue underflow");          return first.item;      }       /**       * Add the item to the queue.       */      public void enqueue(Item item) {          Node oldlast = last;          last = new Node();          last.item = item;          last.next = null;          if (isEmpty()) first = last;          else           oldlast.next = last;          n++;      }        /**       * Removes and returns the item on this queue that was least recently added.       *       * @return the item on this queue that was least recently added       * @throws NoSuchElementException if this queue is empty       */      public Item dequeue() {          if (isEmpty()) throw new NoSuchElementException("Queue underflow");          Item item = first.item;          first = first.next;          n--;          if (isEmpty()) last = null;   // to avoid loitering          return item;      }        /**       * Returns a string representation of this queue.       *       * @return the sequence of items in FIFO order, separated by spaces       */      public String toString() {          StringBuilder s = new StringBuilder();          for (Item item : this) {              s.append(item);              s.append(' ');          }          return s.toString();      }          /**       * Returns an iterator that iterates over the items in this queue in FIFO order.       *       * @return an iterator that iterates over the items in this queue in FIFO order       */      public Iterator iterator()  {          return new ListIterator();      }        // an iterator, doesn't implement remove() since it's optional      private class ListIterator implements Iterator {          private Node current = first;            public boolean hasNext()  { return current != null;                     }          public void remove()      { throw new UnsupportedOperationException();  }            public Item next() {              if (!hasNext()) throw new NoSuchElementException();              Item item = current.item;              current = current.next;              return item;          }      }  }  

Write Java code segment that reads a line of words including '-'. Add to the appropriate data structure when you see a word. Remove and print when you see a '-'. At the end of program, the output will be the items that have been remove from the structure. Input Output to be ot not to be that -- is to be not that ot be