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 os
  import sys
  from io import BytesIO, IOBase
   
  BUFSIZE = 8192
   
   
  class FastIO(IOBase):
      newlines = 0
   
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
   
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
   
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
   
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
                        
              
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
          
  class RangeQuery:
      def __init__(self, data, func=min):
          self.func = func
          self._data = _data = [list(data)]
          i, n = 1, len(_data[0])
          while 2 * i <= n:
              prev = _data[-1]
              _data.append([func(prev[j], prev[j + i]) for j in range(n - 2 * i + 1)])
              i <<= 1
   
      def query(self, start, stop):
          """func of data[start, stop)"""
          depth = (stop - start).bit_length() - 1
          return self.func(self._data[depth][start], self._data[depth][stop - (1 << depth)])
   
      def __getitem__(self, idx):
          return self._data[0][idx]
   
   
  def check(st, n, k):
      for i in range(n-k+1):
          g = st.query(i, i+k)
          if(g > 1):
              return True 
      return False
   
   
   
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  from collections import defaultdict,deque
  from math import ceil,floor,sqrt,log2,gcd,pi
  from heapq import heappush,heappop
  from fractions import Fraction
  from bisect import bisect_left,bisect
  # from itertools import combinations_with_repetition
  import sys
  abc='abcdefghijklmnopqrstuvwxyz'
  ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  
  
  for _ in range(int(input())):
      n=int(input())
      arr=list(map(int,input().split()))
      ans=[]
      if arr[-1]==0:
          ans=list(range(1,n+2))
          print(*ans)
      else:
          flag=0
          val=-1
          for i in range(n-1):
              if arr[i]==0 and arr[i+1]==1:
                  flag=1
                  val=i
                  break
          if flag==0 and arr[0]==0:
              print(-1)
          elif flag==0 and arr[0]==1:
              ans.append(n+1)
              for i in range(1,n+1):
                  ans.append(i)
              print(*ans)
          else:
              for i in range(1,val+2):
                  ans.append(i)
              ans.append(n+1)
              for i in range(val+2,n+1):
                  ans.append(i)
              print(*ans)
                  
          