output_description: Print the answer.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 A_3 ... A_{N}
attempt: N = int(input())
  A = list(map(int, input().strip().split()))
  
  flg = 1
  multi = [x for x in A if A.count(x) > 1]
  result = list(set(multi))
  
  count = 0
  while flg:
      multi.remove(max(multi))
      multi.remove(min(multi))
      multi = [x for x in multi if multi.count(x) > 1]
      if len(multi) == 0:
          flg = 0
      count += 1
  print(len(A) - count * 2)
  
problem_description: Statement
  
  Snuke has decided to play a game using cards. He has a deck consisting of N
  cards. On the i-th card from the top, an integer A_i is written.
  
  He will perform the operation described below zero or more times, so that the
  values written on the remaining cards will be pairwise distinct. Find the
  maximum possible number of remaining cards. Here, N is odd, which guarantees
  that at least one card can be kept.
  
  Operation: Take out three arbitrary cards from the deck. Among those three
  cards, eat two: one with the largest value, and another with the smallest
  value. Then, return the remaining one card to the deck.
samples: [{"input": "5\n    1 2 1 3 7", "output": "3\n    \n\nOne optimal solution is to perform the operation once, taking out two cards\nwith 1 and one card with 2. One card with 1 and another with 2 will be eaten,\nand the remaining card with 1 will be returned to deck. Then, the values\nwritten on the remaining cards in the deck will be pairwise distinct: 1, 3 and\n7.\n\n* * *"}, {"input": "15\n    1 3 5 2 1 3 2 8 8 6 2 6 11 1 1", "output": "7"}]