The Little Girl loves problems on games very much. Here's one of them.

Two players have got a string *s*, consisting of lowercase English letters. They play a game that is described by the following rules:
 -  The players move in turns; In one move the player can remove an arbitrary letter from string *s*. -  If the player before his turn can reorder the letters in string *s* so as to get a palindrome, this player wins. A palindrome is a string that reads the same both ways (from left to right, and vice versa). For example, string "abba" is a palindrome and string "abc" isn't. 
Determine which player will win, provided that both sides play optimally well — the one who moves first or the one who moves second.
The input contains a single line, containing string *s* (1 ≤ |*s*|  ≤  10<sup class="upper-index">3</sup>). String *s* consists of lowercase English letters.
import math
import sys
from collections import deque,OrderedDict,defaultdict
import heapq
from collections import Counter
def inp(): return sys.stdin.readline().rstrip()
def mpp(): return map(int,inp().split())
def lis(): return list(mpp())
def yn(n):
    if n:
        return "YES"
    else:
        return "NO"
def fn(arr,n):
    for i in range(n-2,-1,-1):
        for j in range(n-2,-1,-1):
            #print(arr[i][j],i,j)
            if arr[i][j]=="1" and arr[i+1][j]=="0" and arr[i][j+1]=="0":
                return yn(0)
    return yn(1)
def main():
    n=inp()
    di=Counter(n)
    odd=0
    for i in di:
        if di[i]&1:
            odd+=1
    #print(odd)
    if odd<=1:
        print("first")
    else:
        t=odd
        if t%2==0:
            print("second")
        else:
            print("first")
            
            
                
                
                
    
if __name__=="__main__":
    main()