output_description: If you will win, print `first`; if Lunlun will win, print `second`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1
      a_2
      :
      a_N
attempt: print("sfeicrosntd"[sum([int(input()) % 2 for i in range(int(input()))]) > 0 :: 2])
  
problem_description: Statement
  
  There is an apple tree that bears apples of N colors. The N colors of these
  apples are numbered 1 to N, and there are a_i apples of Color i.
  
  You and Lunlun the dachshund alternately perform the following operation
  (starting from you):
  
    * Choose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.
  
  The one who eats the last apple from the tree will be declared winner. If both
  you and Lunlun play optimally, which will win?
samples: [{"input": "2\n    1\n    2", "output": "first\n    \n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red\napple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat\none of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red\nand one blue (not a winning move, though).\n\n* * *"}, {"input": "3\n    100000\n    30000\n    20000", "output": "second"}]