output_description: If no arrangements satisfy the conditions, print `-1`. If such arrangements
  exist, print the lexicographically smallest such arrangement, in the following
  format:
  
      
      
      b_1 b_2 \ldots b_N
      
  
  Here, b_i represents the i-th card from the left.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 \ldots a_N
attempt: print(-1)
  
problem_description: Statement
  
  Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in
  a row.
  
  Niwango wants to know if there is a way to arrange the cards while satisfying
  all the N conditions below. To help him, determine whether such a way exists.
  If the answer is yes, also find the lexicographically smallest such
  arrangement.
  
    * To the immediate right of Card 1 (if any) is NOT Card a_1.
    * To the immediate right of Card 2 (if any) is NOT Card a_2.
    * \vdots
    * To the immediate right of Card N (if any) is NOT Card a_N.
samples: [{"input": "4\n    2 3 4 1", "output": "1 3 2 4\n    \n\n  * The arrangement (1,2,3,4) is lexicographically smaller than (1,3,2,4), but is invalid, since it violates the condition \"to the immediate right of Card 1 is not Card 2.\"\n\n* * *"}, {"input": "2\n    2 1", "output": "-1\n    \n\n  * If no arrangements satisfy the conditions, print `-1`.\n\n* * *"}, {"input": "13\n    2 3 4 5 6 7 8 9 10 11 12 13 12", "output": "1 3 2 4 6 5 7 9 8 10 12 11 13"}]