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.
class Solution:
    def solve(self, pattern):
        length = len(pattern)
        dp = []
        for i in range(length):
            a = [0 for j in range(length)]
            dp.append(a)
        # print(dp)
        for i in range(length):
            dp[i][i] = 1
            if i != length - 1 and pattern[i] == pattern[i+1]:
                dp[i][i+1] = 2
            elif i != length - 1 and pattern[i] != pattern[i+1]:
                dp[i][i+1] = 1
        # print(dp)
        for l in range(3, length+1):
            for j in range(length-l+1):
                if pattern[j] == pattern[j+l-1]:
                    dp[j][j+l-1] = dp[j+1][j+l-2] + 2
                else:
                    dp[j][j+l-1] = max(dp[j][j+l-2] + 2, dp[j+1][j+l-1] + 2)
        # print(dp)
        if (length-dp[0][length-1]) % 2:
            print("Second")
        else:
            print("First")


if __name__ == "__main__":
    str1 = input()
    t = Solution()
    t.solve(str1)
