Adding or Removing odd and Even Numbers from a Queue in Java

Problem:

You are given a list of integers as input that you should add to a queue. If the integer at the beginning of the queue is an even number, you should remove it from the queue; else, if the integer at the beginning of the queue is odd, you should remove two elements from the queue. Keep repeating this until the queue is empty. The input guarantees that the queue will be empty in the end and no runtime errors will occur. The first line of input n is the number of test cases followed by n lists. Each list begins with an integer t representing the number of integers in the list, and then t integers follow. As output, you should print on each line the number (or numbers) removed.

Output:

3
3234
6123548
584216

Test case 1:
2
34
Test case 2:
12
35
4
8
Test case 3:
8
4
2
16

Solution:

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

*/
public class ProblemC {

 public static void main(String[] args) {
  
  Queue<Integer> q = new LinkedList<Integer>();
  String output = "";
  Scanner scan = new Scanner(System.in);
  
  int testCases = scan.nextInt();
  
  for (int cases = 0; cases < testCases; cases++) {
   
   int t = scan.nextInt();
   
   for (int i = 0; i < t; i++)
    q.offer(scan.nextInt());
   
   output +=( "Test case "+(cases+1)+":" + "\n");
   
   while (!q.isEmpty()) {
    if (q.peek()%2 == 0)
     output += (q.poll() + "\n");
    else {
     output+= q.poll()+" ";
     output += q.poll() + "\n";
    }
   }
  }
  
  System.out.println(output);
 }
}