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.
a =  input()


# print(a)
#
#
# print(a[2])

p= len(a)

count = 0
i = 0
while i <= len(a) - 1 :
    j = i +1
    while j < len(a):
        if (a[i] == a[j]):
            count = count +1
            a = a[:j] + a[j+1:]
            i = i +1
        else:
            j = j + 1
    i = i + 1


if (2 * count == p or 2 * count == p-1):
    print("FIRST")
elif((p - (2 * count)) % 2 == 0):
    print("SECOND")
else:
    print("FIRST")
