output_description: Print the integer obtained by replacing each occurrence of `1` with `9` and
  each occurrence of `9` with `1` in n.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      n
attempt: inp = [[int(x) for x in input().split()] for _ in range(int(input()))]
  inpsum = sum(map(lambda ij: abs(ij[0] + ij[1]) % 2, inp))
  if not (inpsum == len(inp) or inpsum == 0):
      print(-1)
      exit(0)
  
  seeds = ([] if inpsum == len(inp) else [1]) + [1 << i for i in range(0, 32)]
  # print(inp)
  
  print(" ".join(map(str, reversed(seeds))))
  
  for x, y in inp:
      for k in reversed(seeds):
          res = ""
          if abs(x) > abs(y):
              if x > 0:
                  res = "R"
                  x -= k
              else:
                  res = "L"
                  x += k
          else:
              if y > 0:
                  res = "U"
                  y -= k
              else:
                  res = "D"
                  y += k
          # print((x,y))
          print(res, end="")
      print("")
  
problem_description: Statement
  
  Cat Snuke is learning to write characters. Today, he practiced writing digits
  `1` and `9`, but he did it the other way around.
  
  You are given a three-digit integer n written by Snuke. Print the integer
  obtained by replacing each digit `1` with `9` and each digit `9` with `1` in
  n.
samples: [{"input": "119", "output": "991\n    \n\nReplace the `9` in the ones place with `1`, the `1` in the tens place with `9`\nand the `1` in the hundreds place with `9`. The answer is `991`.\n\n* * *"}, {"input": "999", "output": "111"}]