import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy



sys.setrecursionlimit(10**7)

inf=10**20

mod=10**9+7

dd=[(-1,0),(0,1),(1,0),(0,-1)]

ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]



def LI(): return [int(x) for x in sys.stdin.readline().split()]

def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())

def LS(): return sys.stdin.readline().split()

def S(): return eval(input())



def main():

  n=I()

  l=[I() for _ in range(n)]



  for x in l:

    if x%2==1:

      return 'first'

  return 'second'



# main()

print((main()))

import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy



sys.setrecursionlimit(10**7)

inf=10**20

mod=10**9+7

dd=[(-1,0),(0,1),(1,0),(0,-1)]

ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]



def LI(): return [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())

def LS(): return sys.stdin.readline().split()

def S(): return eval(input())



def main():

  # 最後に食べたら勝ち

  # 1を引けば勝ち

  # 奇数調整をする

  # 相手に全て偶数を与えるよう調整する

  # all偶数だと負け



  n=I()

  f=False

  for _ in range(n):

    if I()%2==1:

      f=True

  if f:

    return 'first'

  return 'second'



# main()

print((main()))

import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI():
    return [int(x) for x in sys.stdin.readline().split()]


def LI_():
    return [int(x) - 1 for x in sys.stdin.readline().split()]


def I():
    return int(sys.stdin.readline())


def LS():
    return sys.stdin.readline().split()


def S():
    return eval(input())


def main():
    n = I()
    l = [I() for _ in range(n)]
    for x in l:
        if x % 2 == 1:
            return "first"
    return "second"


# main()
print((main()))

import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI():
    return [int(x) for x in sys.stdin.readline().split()]


def I():
    return int(sys.stdin.readline())


def LS():
    return sys.stdin.readline().split()


def S():
    return eval(input())


def main():
    # 最後に食べたら勝ち
    # 1を引けば勝ち
    # 奇数調整をする
    # 相手に全て偶数を与えるよう調整する
    # all偶数だと負け
    n = I()
    f = False
    for _ in range(n):
        if I() % 2 == 1:
            f = True
    if f:
        return "first"
    return "second"


# main()
print((main()))

-import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy +import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy - - -def LI_(): -    return [int(x) - 1 for x in sys.stdin.readline().split()] +    # 最後に食べたら勝ち +    # 1を引けば勝ち +    # 奇数調整をする +    # 相手に全て偶数を与えるよう調整する +    # all偶数だと負け -    l = [I() for _ in range(n)] -    for x in l: -        if x % 2 == 1: -            return "first" +    f = False +    for _ in range(n): +        if I() % 2 == 1: +            f = True +    if f: +        return "first"