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: #Fast IO Region
  import collections
  import os
  import sys
  from datetime import date
  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")
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  # Get out of main function
  def main():
      pass
  # decimal to binary
  def binary(n):
      return (bin(n).replace("0b", ""))
  # binary to decimal
  def decimal(s):
      return (int(s, 2))
  # power of a number base 2
  def pow2(n):
      p = 0
      while n > 1:
          n //= 2
          p += 1
      return (p)
  # if  number is prime in √n time
  def isPrime(n):
      if (n == 1):
          return (False)
      else:
          root = int(n ** 0.5)
          root += 1
          for i in range(2, root):
              if (n % i == 0):
                  return (False)
          return (True)
  # list to string ,no spaces
  def lts(l):
      s = ''.join(map(str, l))
      return s
  # String to list
  def stl(s):
      # for each character in string to list with no spaces -->
      l = list(s)
      # for space in string  -->
      # l=list(s.split(" "))
      return l
  # Returns list of numbers with a particular sum
  def sq(a, target, arr=[]):
      s = sum(arr)
      if (s == target):
          return arr
      if (s >= target):
          return
      for i in range(len(a)):
          n = a[i]
          remaining = a[i + 1:]
          ans = sq(remaining, target, arr + [n])
          if (ans):
              return ans
  # Sieve for prime numbers in a range
  def SieveOfEratosthenes(n):
      cnt = 0
      prime = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (prime[p] == True):
              for i in range(p * p, n + 1, p):
                  prime[i] = False
          p += 1
      for p in range(2, n + 1):
          if prime[p]:
              cnt += 1
              # print(p)
      return (cnt)
  # for positive integerse only
  def nCr(n, r):
      f = math.factorial
      return f(n) // f(r) // f(n - r)
  # 1000000007
  mod = int(1e9) + 7
  import math
  import statistics
  #import random
  from bisect import bisect_right
  #from fractions import Fraction
  #from collections import OrderedDict
  #from collections i
  # mport deque
  ########################                         mat=[[0 for i in range(n)] for j in range(m)]                      ########################
  ########################                         list.sort(key=lambda x:x[1]) for sorting a list according to second element in sublist            ########################
  ########################                         Speed: STRING < LIST < SET,DICTIONARY                      ########################
  ########################                         from collections import deque                              ########################
  ########################                         ASCII of A-Z= 65-90                                        ########################
  ########################                         ASCII of a-z= 97-122                                       ########################
  ########################                         d1.setdefault(key, []).append(value)                       ########################
  #sys.setrecursionlimit(500000)          #Gives memory limit exceeded if used a lot
  #import heapq
  for __ in range(int(input())):
      n=int(input())
      a=list(map(int,input().split()))
      ans=[]
      f=0
      for i in range(n):
          if(f==0 and a[i]==1):
              f=1
              ans.append(n+1)
              ans.append(i+1)
          else:
              ans.append(i+1)
      if(len(ans)!=n+1):
          ans.append(n+1)
      print(*ans)