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 sys
from os import path
from math import gcd,floor,sqrt,log
from bisect import bisect_left, bisect_right

############ ---- Input Functions ---- ####################
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
############################################################
def cuberoot(x):
    if 0<=x: return x**(1./2.)
    return -(-x)**(1./2.)
def is_anagram(str1, str2):
    return sorted(str1) == sorted(str2)
def f_list(arr,con,n):
    return (list(filter(lambda x: con, range(n))))
ceil   =lambda x: int(x) if(x==int(x)) else int(x)+1
############################################################
mod=1000000007
############################################################
if(path.exists('input.txt')):
    sys.stdin = open("input.txt","r")
    sys.stdout = open("output.txt","w")
    sys.stderr = open("error.txt", "w")
############################################################
def diagonalOrder(matrix,n):
	s=0
	for line in range(1, (n + n)):
		s1=0
		start_col = max(0, line - n)
		count = min(line, (n - start_col), n)

		# Print elements of this line
		for j in range(0, count):
			s1+=matrix[min(n, line) - j - 1][start_col + j]
		s=max(s,s1)
	return s
#############################################################

def solve():
	s=input().strip()
	if s==s[::-1]:
		print("FIRST")
		return 
	i=0
	j=len(s)-1
	count=0
	flag=True
	while i!=j and i< j:
		if s[i]!=s[j] and flag:
			count+=1
			i+=1
		elif s[i]!=s[j] and not flag:
			count+=1
			j-=1
		else:
			i+=1
			j-=1
	print("First" if count%2==0 else "Second")

def main():
    #T=inp()
    T=1
    for i in range(T):
    	#print("Case #{}:".format(i+1),end=" ")
    	solve()

main()  