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?
from sys import stdin
N = int(stdin.readline().rstrip())
A = [0]*N
if all([i % 2 == 0 for i in A]):
    print("second")
else:
    print("first")
from sys import stdin
N = int(stdin.readline().rstrip())
A = [0]*N
for i in range(N):
    A[i] = int(stdin.readline().rstrip())

if all([i % 2 == 0 for i in A]):
    print("second")
else:
    print("first")