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.
def main():
    #elems = list(map(int, input().split(' ')))
    s = input()

    def cnt_odds(s):
        odds = 0
        cnt = {}
        for x in s:
            if x not in cnt:
                cnt[x] = 0
            cnt[x] += 1

        for x in cnt.values():
            if x % 2 > 0:
                odds += 1
        return odds


    winners = ['First', 'Second']
    i = 0
    while True:
        odds = cnt_odds(s)
        if odds <= 1:
            print(winners[i % 2])
            break
        for j in range(len(s)):
            substr = s[0:j] + s[j+1:]
            new_odds = cnt_odds(substr)
            if new_odds < odds:
                s = substr
                break
        i += 1


if __name__ == "__main__":
    main()
