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.
from random import randrange
import time
import threading
from math import sqrt, ceil, inf, comb, log2, gcd
from itertools import *
import functools
from collections import *
from copy import *
import heapq
from math import *
import sys
# from pprint import pprint as pprint
# from sympy.ntheory.modular import crt
from fractions import Fraction
import bisect


def solve():
    s = input()
    if s == s[::-1]:
        print("First")
        return

    if len(s) % 2:
        print("First")
    else:
        print("Second")


if __name__ == "__main__":
    # t = int(input())
    # for _ in range(t):
    #     solve()
    solve()
