input: Write a python function to verify if the inversion counts of two types match.
  assert solve([1,0,2],3) == True
  assert solve([1,2,0],3) == False
  assert solve([1,2,1],3) == True
output: def solve(l, n):
      inversion_counts = []
      for i in range(1, max(l) + 1):
          inv_count = 0
          for j in range(n):
              for k in range(j + 1, n):
                  if l[j] == l[k] == i and l[j] > l[k]:
                      inv_count += 1
          inversion_counts.append(inv_count)
      return len(set(inversion_counts)) == 1