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,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 LF(): return [float(x) for x in sys.stdin.readline().split()]

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

def F(): return float(sys.stdin.readline())

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

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



def main():

  N=I()

  a=[I() for _ in range(N)]



  for x in a:

    if x%2!=0:

      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, 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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def I():
    return int(sys.stdin.readline())


def F():
    return float(sys.stdin.readline())


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


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


def main():
    N = I()
    a = [I() for _ in range(N)]
    for x in a:
        if x % 2 != 0:
            return "first"
    return "second"


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

+# def LF(): return [float(x) for x in sys.stdin.readline().split()] + + +def F(): +    return float(sys.stdin.readline()) -    # 最後に食べたら勝ち -    # 1を引けば勝ち -    # 奇数調整をする -    # 相手に全て偶数を与えるよう調整する -    # all偶数だと負け -    n = I() -    f = False -    for _ in range(n): -        if I() % 2 == 1: -            f = True -    if f: -        return "first" +    N = I() +    a = [I() for _ in range(N)] +    for x in a: +        if x % 2 != 0: +            return "first"