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.
b=input()
a=list(b)
n=len(a)
for i in range(n):
    b=0
    for j in range(len(a)):
        if(a[j]!=a[-1-j]):
            b=1
            if(a[j]==a[j+1]):
                a.remove(a[-1-j])
            elif(a[-1-j]==a[-2-j]):
                a.remove(a[j])
            else:
                a.remove(a[-1-j])
            break
    if(b==0):
        if(i%2==0):
            print("first")
        else:
            print("second")
        break