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: N = int(input())
  V = list(map(int, input().split()))
  A = [0] * (10**5 + 1)
  B = [0] * (10**5 + 1)
  for i in range(N):
      if i % 2 == 0:
          A[V[i]] += 1
      else:
          B[V[i]] += 1
  MA = 0
  NA = A[0]
  MB = 0
  NB = B[0]
  for i in range(10**5 + 1):
      if A[i] >= NA:
          NA = A[i]
          MA = i
      if B[i] >= NB:
          NB = B[i]
          MB = i
  A.sort(reverse=True)
  B.sort(reverse=True)
  if MA != MB:
      print(N - NA - NB)
  else:
      print(min(N - A[0] - B[1], N - A[1] - B[0]))
  
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"}]