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.util.*;
  
  public class Main {
      static PrintWriter pw;
      static Scanner sc;
      static long ceildiv(long x, long y) { return (x+y-1)/y; }
      static int mod(long x, int m) { return (int)((x%m+m)%m); }
      static void put(Map<Integer, Integer> map, Integer p){if(map.containsKey(p)) map.replace(p, map.get(p)+1); else map.put(p, 1); }
      static void rem(Map<Integer, Integer> map, Integer p){ if(map.get(p)==1) map.remove(p);else map.replace(p, map.get(p)-1); }
      static void printf(double x, int dig){ String s="%."+dig+"f"; pw.printf(s, x); }
      static int Int(boolean x){ return x?1:0; }
      static final int inf=(int)1e9, mod= inf + 7;
      static final long infL=inf*1l*inf;
      static final double eps=1e-9;
      public static long gcd(long x, long y) { return y==0? x: gcd(y, x%y); }
      public static void main(String[] args) throws Exception {
          sc = new Scanner(System.in);
          pw = new PrintWriter(System.out);
          int t = sc.nextInt();
          while (t-- > 0)
              testcase();
          pw.close();
      }
  
      static void testcase() throws IOException {
          int n = sc.nextInt();
          int[] arr = sc.nextArr(n);
          if(arr[0] == 1){
              pw.print(n+1+" ");
              for (int i = 1; i <= n; i++)
                  pw.print(i+" ");
              pw.println();
          }else if(arr[n-1] == 0){
              for (int i = 1; i <= n+1; i++)
                  pw.print(i+" ");
              pw.println();
          }else{
              int idx = -1;
              for (int i = 1; i < n; i++) {
                  if(arr[i] == 1 && arr[i-1] == 0){
                      idx = i;
                      break;
                  }
              }
              if(idx == -1){
                  pw.println(-1);
                  return;
              }
              for (int i = 1; i <= idx; i++)
                  pw.print(i+" ");
              pw.print(n+1+" ");
              for (int i = idx+1; i <= n; i++)
                  pw.print(i+" ");
          }
      }
  
      static char opp(char c){
          return c=='B' ? 'R' : 'B';
      }
  
      static void printArr(int[] arr) {
          for (int i = 0; i < arr.length; i++)
              pw.print(arr[i] + " ");
          pw.println();
      }
      static void printArr(long[] arr) {
          for (int i = 0; i < arr.length; i++)
              pw.print(arr[i] + " ");
          pw.println();
      }
      static void printArr(double[] arr) {
          for (int i = 0; i < arr.length; i++)
              pw.print(arr[i] + " ");
          pw.println();
      }
      static void printArr(Integer[] arr) {
          for (int i = 0; i < arr.length; i++)
              pw.print(arr[i] + " ");
          pw.println();
      }
      static void printArr(List list) {
          for (Object o : list)
              pw.print(o+" ");
          pw.println();
      }
      static void printArr(boolean[] arr) {
          StringBuilder sb=new StringBuilder();
          for(boolean b: arr)
              sb.append(Int(b));
          pw.println(sb);
      }
      static class Scanner {
          StringTokenizer st;
          BufferedReader br;
          public Scanner(InputStream s) {
              br = new BufferedReader(new InputStreamReader(s));
          }
  
          public Scanner(FileReader r) {
              br = new BufferedReader(r);
          }
  
          public String next() throws IOException {
              while (st == null || !st.hasMoreTokens())
                  st = new StringTokenizer(br.readLine());
              return st.nextToken();
          }
  
          public int nextInt() throws IOException {
              return Integer.parseInt(next());
          }
  
          public long nextLong() throws IOException {
              return Long.parseLong(next());
          }
  
          public String nextLine() throws IOException {
              return br.readLine();
          }
  
          public double nextDouble() throws IOException {
              return Double.parseDouble(next());
          }
          public int[] nextDigits() throws IOException{
              String s=nextLine();
              int[] arr=new int[s.length()];
              for(int i=0; i<arr.length; i++)
                  arr[i]=s.charAt(i)-'0';
              return arr;
          }
          public int[] nextArr(int n) throws IOException {
              int[] arr = new int[n];
              for (int i = 0; i < arr.length; i++)
                  arr[i] = nextInt();
              return arr;
          }
          public Integer[] nextsort(int n) throws IOException{
              Integer[] arr=new Integer[n];
              for(int i=0; i<n; i++)
                  arr[i]=nextInt();
              return arr;
          }
          public Pair nextPair() throws IOException{
              return new Pair(nextInt(), nextInt());
          }
          public long[] nextLongArr(int n) throws IOException{
              long[] arr=new long[n];
              for (int i = 0; i < n; i++)
                  arr[i]=sc.nextLong();
              return arr;
          }
          public Pair[] nextPairArr(int n) throws IOException{
              Pair[] arr=new Pair[n];
              for(int i=0; i<n; i++)
                  arr[i]=nextPair();
              return arr;
          }
          public boolean hasNext() throws IOException {
              return (st!=null && st.hasMoreTokens()) || br.ready();
          }
      }
      static class Pair implements Comparable<Pair> {
          int x;
          int y;
  
          public Pair(int x, int y) {
              this.x = x;
              this.y = y;
          }
  
          public Pair(Map.Entry<Integer, Integer> a) {
              x = a.getKey();
              y = a.getValue();
          }
  
          public boolean inRange(int mid){
              return mid>=x && mid<=y;
          }
  
          public boolean contains(int a) {
              return x == a || y == a;
          }
  
          public int hashCode() {
              return (this.x*mod + this.y);
          }
  
          public int compareTo(Pair p) {
              return Integer.compare(x, p.x);
          }
  
          public boolean equals(Object obj) {
              if (obj == null) {
                  return false;
              }
              if (this.getClass() != obj.getClass()) {
                  return false;
              }
              Pair p = (Pair) obj;
              return this.x == p.x && this.y == p.y;
          }
  
          public Pair clone() {
              return new Pair(x, y);
          }
  
          public String toString() {
              return this.x + " " + this.y;
          }
  
          public void add(Pair p) {
              x += p.x;
              y += p.y;
          }
      }
  }