You and Lunlun the dachshund take turns eating apples from a tree with apples of different colors. The one who eats the last apple wins. Given the number of apples of each color, determine who will win if both play optimally. The input consists of the number of colors and the count of apples for each color. Output "first" if you will win, and "second" if Lunlun will win. For example, if there are two colors with 1 and 2 apples respectively, you can win by eating strategically. If there are three colors with large apple counts, Lunlun will win.

# Buggy version:
n = int(input())
a = [int(input()) for _ in range(n)]
ans = 'second' if any(a[i] % 2 == 0 for i in range(n)) else 'first'
print(ans)


# Fixed version:
n = int(input())
a = [int(input()) for _ in range(n)]
ans = 'second' if all(a[i] % 2 == 0 for i in range(n)) else 'first'
print(ans)

# Buggy version:
n = int(input())
l = []
for _ in range(n):
    a = int(input())
    l.append(a)
b = True
for i in range(n):
    if l[i] % 2 != 0:
        b = False
if b:
    print('first')
else:
    print('second')

# Fixed version:
n = int(input())
l = []
for _ in range(n):
    a = int(input())
    l.append(a)
b = True
for i in range(n):
    if l[i] % 2 != 0:
        b = False
if b:
    print('second')
else:
    print('first')

# Buggy version:
n = int(input())
a = [0]*n
for i in range(n):
    a[i] = int(input())
s = 1
for i in range(n):
    if a[i]%2 == 1:
        s = 0
        break
print(["first","secound"][s])

# Fixed version:
n = int(input())
a = [0]*n
for i in range(n):
    a[i] = int(input())
s = 1
for i in range(n):
    if a[i]%2 == 1:
        s = 0
        break
print(["first","second"][s])

# Buggy version:
n=int(input())

a=[int(input()) for _ in range(n)]

flag=0
for aa in a:
    if aa%2==1:
        flag=1
if flag=="0":
    print("Second")
else:
    print("First")

###1個
#111
#奇数ならfirst 偶数ならsecond

###２個
#111
#111
#奇数奇数ならfirst
#11
#11
#偶数偶数ならsecond
#



# Fixed version:
n=int(input())

a=[int(input()) for _ in range(n)]

flag=0
for aa in a:
    if aa%2==1:
        flag=1

if flag==0:
    print("second")
else:
    print("first")

###1個
#111
#奇数ならfirst 偶数ならsecond

###２個
#111
#111
#奇数奇数ならfirst
#11
#11
#偶数偶数ならsecond
#

# Buggy version:

        
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()

    n = int(input())
    flag = 0
    for i in range(n):
        a = int(intput())
        flag &= (a%2 == 1)
    if flag:
        print('first')
    else:
        print('second')

    




                
if __name__ == '__main__':
    main()

# Fixed version:

        
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()

    n = int(input())
    flag = 0
    for i in range(n):
        a = int(input())
        if a%2 == 1:
            print('first')
            return
    print('second')


    




                
if __name__ == '__main__':
    main()

# Buggy version:
def main():
    n = int(input())
    a = [int(input) for i in range(n)]
    ans = sum(a)
    if(ans % 2 == 0):
        print('second')
    else:
        print('first')

main()

# Fixed version:
def main():
    n = int(input())
    a = list([(int(input())) % 2 for i in range(n)])
    ans = sum(a)
    if(ans == 0):
        print('second')
    else:
        print('first')

main()

# Buggy version:
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

n=I()
lis=LI()
for i in range(n):
    if lis[i]%2==1:
        print("first")
        exit()
print("second")
    
    
    
    




# Fixed version:
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

n=I()
lis=[I() for i in range(n)]
for i in range(n):
    if lis[i]%2==1:
        print("first")
        exit()
print("second")

# Buggy version:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

n=int(input())
a=[int(input()) for i in range(n)]

f="first"
s="second"
# print(a)
if sum(a)==n sum(a)==n+1:
    print(f)
    exit()
# print(sum(a)%2)
if sum(a)%2:
    print(f)
else:
    print(s)

# Fixed version:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

n=int(input())
a=[int(input()) for i in range(n)]

f="first"
s="second"
for i in range(n):
    if a[i]%2==1:
        print(f)
        break
else:
    print(s)

# Buggy version:
def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    if any([a % 2 != 0 for a in A]):
        print('second')
    else:
        print('first')

if __name__ == '__main__':
    main()


# Fixed version:
def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    if all([a % 2 == 0 for a in A]):
        print('second')
    else:
        print('first')

if __name__ == '__main__':
    main()

# Buggy version:
n=int(input())
cnt=0
for i in range(n):
    a=int(input())
    cnt+=(a%2)
if:
    if cnt==0:
        print("second")
    else:
        print("first")

# Fixed version:
n=int(input())
cnt=0
for i in range(n):
    a=int(input())
    cnt+=(a%2)
if cnt==0:
    print("second")    
else:
    print("first")

# Buggy version:
N = int(input())
for i in range(N)
    if int(input())%2 != 0:
        print("first")
        exit()
print('second')

# Fixed version:
N = int(input())
for i in range(N):
    if int(input())%2 != 0:
        print("first")
        exit()
print('second')

# Buggy version:
n = int(input())
al = [0] * n
for i in range(n):
    a = int(input())
    if a % 2 == 0:
        print('second')
        break
else:
    print('first')


# Fixed version:
n = int(input())
al = [0] * n
for i in range(n):
    a = int(input())
    if a % 2 != 0:
        print('first')
        break
else:
    print('second')

# Buggy version:
_, *a = open(0)
print(["second","first"][any(int(b)%2 for b in a)]

# Fixed version:
_, *a = open(0)
print(["second","first"][any(int(b)%2 for b in a)])

# Buggy version:
N = int(input())
A = [int(input()) for _ in range(N)]

odd_flag = False
for a in range(N):
    if a % 2 == 1:
        odd_flag = True
        break

if odd_flag:
    print("first")
else:
    print("second")


# Fixed version:
N = int(input())
A = [int(input()) for _ in range(N)]

odd_flag = False
for a in A:
    if a % 2 == 1:
        odd_flag = True
        break

if odd_flag:
    print("first")
else:
    print("second")

# Buggy version:
N = int(input())
ret = "seconde"
for _ in range(N):
    a = int(input())
    if a % 2 != 0:
        ret = "first"
print(ret)


# Fixed version:
N = int(input())
ret = "second"
for _ in range(N):
    a = int(input())
    if a % 2 != 0:
        ret = "first"
print(ret)

# Buggy version:
n = int(input())
A = list(int(input()) for _ in range(n))

flg = False
for i in range(n):
    if A[i]%2==0:
        flg = True
        break
if flg:
    print('second')
else:
    if (sum(A)-1)%2==0:
        print('first')
    else:
        print('second')

# Fixed version:
n = int(input())
A = list(int(input()) for _ in range(n))

flg = False
for i in range(n):
    if A[i]%2==1:
        flg = True
        break
if flg:
    print('first')
else:
    print('second')

# Buggy version:
N = int(input())
a = list(int(input()) for _ in range(N)))
print('second' if all(a[i] % 2 == 0 for i in range(N)) else 'first')

# Fixed version:
N = int(input())
a = list(int(input()) for i in range(N))

if all(a[i] % 2 == 0 for i in range(N)):
    print('second')
else:
    print('first')

# Buggy version:
n = int(input())
for i in range(n):
    p = int(input())
    if p % 2 == 0:
        continue
    else:
        print("first")

print("second")

# Fixed version:
n = int(input())
for i in range(n):
    p = int(input())
    if p % 2 == 0:
        continue
    else:
        print("first")
        exit()

print("second")

# Buggy version:
N = int(input())
A = [int(input()) for _ in range(N)]

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


# Fixed version:
N = int(input())
A = [int(input()) for _ in range(N)]

if not all(a % 2 == 0 for a in A):
  print('first')
else:
  print('second')

# Buggy version:
n = int(input())
a = [int(input()) for i in range(n)]

for i in range(n):
    if i % 2 == 1:
        print("first")
        exit()
print("second")

# Fixed version:
n=int(input())
a=list(int(input()) for i in range(n))

for i in range(n):
    if a[i]%2==1:
        print('first')
        exit()
print('second')

# Buggy version:
import sys
n = int(input())
A = [int(sys.stdin.readline()) for _ in range(n)]
print("second" if all(a[i]%2==0 for i in range(n)) else 'first')

# Fixed version:
import sys
input=sys.stdin.readline
n=int(input())
a=[int(input()) for _ in range(n)]
print("second" if all(a[i]%2==0 for i in range(n)) else "first")

# Buggy version:
#%%
n = int(input())
a = [0] * n
flag = True
for i in range(n):
    a[i] = int(input())
    if a[i] % 2 == 1:
        flag = False

if flag:
    print('first')
else:
    print('second')

# Fixed version:
#%%
n = int(input())
a = [0] * n
flag = True
for i in range(n):
    a[i] = int(input())
    if a[i] % 2 == 1:
        flag = False

if not flag:
    print('first')
else:
    print('second')

# Buggy version:
n=int(input())
lists=[]
for i in range(n):
	s=int(input())
  	lists.append(s)
if all(lists[i]%2==0 for i in range(n)):
  print("second")
else:
  print("first")

# Fixed version:
n=int(input())
lists=[]
for i in range(n):
    s=int(input())
    lists.append(s)
if all(lists[i]%2==0 for i in range(n)):
    print("second")
else:
    
    print("first")

# Buggy version:
n=int(input())
a= [int(input()) for i in range(N)]
for i in a:
    if i%2!=0:
        print("first")
        exit(0)
print("second")


# Fixed version:
n=int(input())
a= [int(input()) for i in range(n)]
for i in a:
    if i%2!=0:
        print("first")
        exit(0)
print("second")

# Buggy version:

n=input()
a=[int(input()) for _ in range(n)]
if any(x%2==1 for x in a):
    print('first')
else:
    print('second')

# Fixed version:
n=int(input())
a=[int(input()) for _ in range(n)]
if any(x%2==1 for x in a):
    print('first')
else:
    print('second')

# Buggy version:
n = int(input())

a = [0] * n
for i in range(n):
    a[i] = int(input())

for i in range(n):
    if a[i] %2 == 0:
        continue
    else:
        print("first")
        exit()

print("secoond")

# Fixed version:
n = int(input())

a = [0] * n
for i in range(n):
    a[i] = int(input())

for i in range(n):
    if a[i] %2 == 0:
        continue
    else:
        print("first")
        exit()

print("second")

# Buggy version:
N = int(input())
A = [int(input()) for _ in range(N)]
print('first' if all(A[i] % 2 == 0 for i in range(N)) else 'second')

# Fixed version:
N = int(input())
A = [int(input()) for _ in range(N)]
print('second' if all(A[i] % 2 == 0 for i in range(N)) else 'first')

# Buggy version:
n = int(input())

for _ in range(n):
    if int(input())%2 == 0:
        print("second")
        exit()
else:
    print("first")


# Fixed version:
n = int(input())
for _ in range(n):
    if int(input()) % 2:
        print('first')
        exit()
print('second')

# Buggy version:
#%%
n = int(input())
flag = True
for i in range(n):
    a[i] = int(input())
    if a[i] % 2 == 1:
        flag = False

if flag:
    print('first')
else:
    print('second')

# Fixed version:
n = int(input())
a = [int(input()) for _ in range(n)]

flag = False
for i in range(n):
  if a[i]%2 == 1:
    flag = True
    
print("first" if flag else "second")

# Buggy version:
N = int(input())
aList = [int(input()) for _ in range(N)]

ans = "fisrt"
for a in aList:
    if a % 2 == 1:
        break
else:
    ans = "second"

print(ans)

# Fixed version:
N = int(input())
aList = [int(input()) for _ in range(N)]

ans = "first"
for a in aList:
    if a % 2 == 1:
        break
else:
    ans = "second"

print(ans)

# Buggy version:
N=input()
count=0
for i in range(N):
  	count+=input()%2
if count>0:
	print("first")
else:
  	print("second")

# Fixed version:
N=int(input())
count=0
for i in range(N):
    count+=int(input())%2
if count>0:
    print("first")
else:
    print("second")

# Buggy version:
print("second" if all([int(input()) % 2 == 0 for i in range(input())]) else "first")


# Fixed version:
print("second" if all(int(input())%2 == 0 for i in range(int(input()))) else 'first')

# Buggy version:
n = int(input())

a = []

for i in range(n):
  a.append(int(input())

print('second' if all(a[i] % 2 == 0 for i in range(n)) else 'first')


# Fixed version:
n = int(input())
a = []
for i in range(n):
  a.append(int(input()))
print('second' if all(a[i]%2==0 for i in range(n)) else 'first')

# Buggy version:
n=input()
if [i for i in [int(input()) for _ in range(n)] if i % 2]:
  print('first')
 else:
  print('second')

# Fixed version:
n=int(input())
if [i for i in [int(input()) for _ in range(n)] if i % 2]:
    print('first')
else:
    print('second')

# Buggy version:
n=int(input())
a=[int(input()) for i in range(n)]
b=list(set(a))
if len(b)==1 and b[0]==1:
    print("first")
elif sum(a)%2==0:
    if n%2==1:
        print("first")
    else:
        print("second")
else:
    print("first")



# Fixed version:
n=int(input())
a=[int(input()) for i in range(n)]
b=list(set(a))
c=0
for i in range(n):
    if a[i]%2==1:
        c+=1
if len(b)==1 and b[0]==1:
    print("first")
elif sum(a)%2==0:
    if c%2==0 and c>=2:
        print("first")
    else:
        print("second")
else:
    print("first")

# Buggy version:
n = int(input())
a_list = [int(input()) for _ in range(n)]

d = ["second", "first"]

for a in a_list:
  if a % 2 != 0:
    print(d[1])
else:
  print(d[0])

# Fixed version:
n = int(input())
a_list = [int(input()) for _ in range(n)]

d = ["second", "first"]

for a in a_list:
  if a % 2 != 0:
    print(d[1])
    break
else:
  print(d[0])

# Buggy version:
N = int(input())
A = [int(input()) for _ in range(N)]

print("second" if all(a[i] % 2 == 0 for i in range(N)) else "first")


# Fixed version:
N = int(input())
A = [int(input()) for _ in range(N)]
if all(a % 2 == 0 for a in A):
    print("second")
else:
    print("first")

# Buggy version:
N=int(input())
a=[int(i) for i in range(N)]
for i in a:
  if i%2==1:
    print("first")
    exit()
print("second")


# Fixed version:
N = int(input())
A = [int(input()) for i in range(N)]

for a in A:
    if a%2:
        print('first')
        exit()
print('second')

# Buggy version:
N = int(input())
for i in range(N):
  if int(input)() % 2:
    print('first')
    break
else:
  print('second')

# Fixed version:
N = int(input())

for i in range(N):
    if int(input()) % 2 == 1:
        print("first")
        break
else:
    print("second")