#!/usr/bin/python3

n = int(input())
l = sorted([int(x) for x in input().split()])
m = sorted([int(x) for x in input().split()])

ct1 = 0
im = 0
for lv in l:
    while im < len(m) and m[im] < lv:
        im += 1
    ct1 += im

ct2 = 0
il = 0
for mv in m:
    while il < len(l) and l[il] < mv:
        il += 1
    ct2 += il

if ct1 == ct2:
    print("tie")
elif ct1 > ct2:
    print("first")
else:
    print("second")