description: The city where Mocha lives in is called Zhijiang. There are n+1 villages and 2n-1 directed roads in this city. 
  
  There are two kinds of roads:
  
    * n-1 roads are from village i to village i+1, for all 1≤ i ≤ n-1. 
    * n roads can be described by a sequence a_1,…,a_n. If a_i=0, the i-th of these roads goes from village i to village n+1, otherwise it goes from village n+1 to village i, for all 1≤ i≤ n. 
  
  
  
  Mocha plans to go hiking with Taki this weekend. To avoid the trip being boring, they plan to go through every village exactly once. They can start and finish at any villages. Can you help them to draw up a plan? 
  
  Input
  
  Each test contains multiple test cases. 
  
  The first line contains a single integer t (1 ≤ t ≤ 20) — the number of test cases. Each test case consists of two lines.
  
  The first line of each test case contains a single integer n (1 ≤ n ≤ 10^4) — indicates that the number of villages is n+1.
  
  The second line of each test case contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 1). If a_i=0, it means that there is a road from village i to village n+1. If a_i=1, it means that there is a road from village n+1 to village i.
  
  It is guaranteed that the sum of n over all test cases does not exceed 10^4.
  
  Output
  
  For each test case, print a line with n+1 integers, where the i-th number is the i-th village they will go through. If the answer doesn't exist, print -1.
  
  If there are multiple correct answers, you can print any one of them.
  
  Example
  
  Input
  
  
  2
  3
  0 1 0
  3
  1 1 0
  
  
  Output
  
  
  1 4 2 3 
  4 1 2 3 
  
  Note
  
  In the first test case, the city looks like the following graph:
  
  <image>
  
  So all possible answers are (1 → 4 → 2 → 3), (1 → 2 → 3 → 4).
  
  In the second test case, the city looks like the following graph:
  
  <image>
  
  So all possible answers are (4 → 1 → 2 → 3), (1 → 2 → 3 → 4), (3 → 4 → 1 → 2), (2 → 3 → 4 → 1).
solution: 
  import java.io.*;
  import java.sql.ResultSetMetaData;
  import java.text.DecimalFormat;
  import java.util.*;
  
  
  public class Main {
  
      public static void main(String[] args) throws IOException {
          Reader.init(System.in);
          BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
          int t = Reader.nextInt();
          while ( t > 0){
              int n = Reader.nextInt();
              int array[] = new int[n];
              int i  = 0;
              while ( i < n){
                  array[i] = Reader.nextInt();
                  i++;
              }
              if ( array[0] == 1){
                  System.out.print((n+1)+" ");
                  i = 1;
                  while (  i <= n){
                      System.out.print(i+" ");
                      i++;
                  }
                  System.out.println();
              }
              else{
                  if ( n == 1){
                      System.out.println("1 2");
                  }
                  else{
                      i = 1;
                      while ( i < n){
                          if ( array[i] == 1){
                              break;
                          }
                          i++;
                      }
                      if ( i == n){
                          i = 1;
                          while ( i <= n+1){
                              System.out.print(i+" ");
                              i++;
                          }
                          System.out.println();
                      }
                      else{
                          int j = 0;
                          while ( j != i){
                              System.out.print((j+1)+" ");
                              j++;
                          }
                          System.out.print((n+1)+" ");
                          while ( i < n){
                              System.out.print((i+1)+" ");
                              i++;
                          }
                          System.out.println();
  
                      }
                  }
              }
              t--;
          }
  
      }
  
  
  
      private static int bs(int low,int high,int[] array,int find){
          if ( low <= high ){
              int  mid = low + (high-low)/2;
              if ( array[mid] > find){
                  high = mid -1;
                  return bs(low,high,array,find);
              }
              else if ( array[mid] < find){
                  low = mid+1;
                  return bs(low,high,array,find);
              }
              return mid;
          }
          return -1;
      }
  
      private static int max(int a, int b) {
          return  Math.max(a,b);
      }
  
      private static int min(int a,int b){
          return  Math.min(a,b);
      }
  
      public static long modularExponentiation(long a,long b,long mod){
          if ( b == 1){
              return a;
          }
          else{
              long ans = modularExponentiation(a,b/2,mod)%mod;
              if ( b%2 == 1){
                  return (a*((ans*ans)%mod))%mod;
              }
  
              return ((ans*ans)%mod);
          }
      }
  
      public static long sum(long n){
          return  (n*(n+1))/2;
      }
      public static long abs(long a){
          return a < 0 ? (-1*a) : a;
      }
      public static long gcd(long a,long b){
          if ( a == 0){
              return b;
          }
          else{
              return gcd(b%a,a);
          }
      }
  
  
  }
  
  class Reader {
      static BufferedReader reader;
      static StringTokenizer tokenizer;
  
  
      static void init(InputStream input) {
          reader = new BufferedReader(
                  new InputStreamReader(input));
          tokenizer = new StringTokenizer("");
      }
  
      static String next() throws IOException {
          while ( ! tokenizer.hasMoreTokens() ) {
  
              tokenizer = new StringTokenizer(
                      reader.readLine() );
          }
          return tokenizer.nextToken();
      }
  
      static int nextInt() throws IOException {
          return Integer.parseInt( next() );
      }
  
      static double nextDouble() throws IOException {
          return Double.parseDouble( next() );
      }
  
      static long nextLong() throws IOException{
          return Long.parseLong(next());
      }
  }
  
  class IComparator implements Comparator<Integer>{
      @Override
      public int compare(Integer o1, Integer o2) {
          return o2-o1;
      }
  }
  
  class Node{
      int data;
      Node link;
      Node( int v){
          data = v;
          link = null;
      }
      Node (int v, Node c){
          data = v;
          link = c;
      }
      void add(Node a){
          a.link = this.link;
          this.link = a;
      }
  
      Node move(){
          return this.link;
      }
  
  }