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 collections
from math import log2, log10, ceil

def pow2(n):
    t = 0
    while not(n&1):
        n = n//2
        t += 1
    return t

def solve():
    s = list(input())
    s.sort()

    codd = 0
    count = 1
    for i in range(1, len(s)):
        if s[i]!=s[i-1]:
            if count%2:
                codd += 1
            count = 1
        else:
            count += 1
    
    if count%2:
        codd += 1

    if codd%2:
        print("First")
    else:
        print("Second")

def main():
    t = 1
    while t:
        t -= 1
        solve()

if __name__ == '__main__':
    main()
