N = int(eval(input()))

A = [int(eval(input()))%2 for n in range(N)] 

 

for i in range(N):

    if A[i] == 1:

        print("first")

        break

else: print("second")
import sys

from collections import deque



def solve():

    input = sys.stdin.readline

    N = int(eval(input()))

    first = False

    for _ in range(N):

        a = int(eval(input()))

        if a % 2 == 1: first = True

    if first: print("first")

    else: print("second")

    

            

    return 0



if __name__ == "__main__":

    solve()
N = int(eval(input()))
A = [int(eval(input())) % 2 for n in range(N)]
for i in range(N):
    if A[i] == 1:
        print("first")
        break
else:
    print("second")

import sys
from collections import deque


def solve():
    input = sys.stdin.readline
    N = int(eval(input()))
    first = False
    for _ in range(N):
        a = int(eval(input()))
        if a % 2 == 1:
            first = True
    if first:
        print("first")
    else:
        print("second")
    return 0


if __name__ == "__main__":
    solve()

-N = int(eval(input())) -A = [int(eval(input())) % 2 for n in range(N)] -for i in range(N): -    if A[i] == 1: +import sys +from collections import deque + + +def solve(): +    input = sys.stdin.readline +    N = int(eval(input())) +    first = False +    for _ in range(N): +        a = int(eval(input())) +        if a % 2 == 1: +            first = True +    if first: -        break -else: -    print("second") +    else: +        print("second") +    return 0 + + +if __name__ == "__main__": +    solve()