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.
# -*- coding: utf-8 -*-
"""contest

Automatically generated by Colaboratory.

Original file is located at
    https://colab.research.google.com/drive/1vkqd1IDYYeIi4VIH6yqQEhbS4qcGMzLO
"""

word = input()
turn = 0
while True:
  first = sorted(word[:len(word) // 2])
  first = "".join(first)
  if len(word) % 2 == 0:
    second = sorted(word[len(first):])
  else:
    second = sorted(word[len(first) + 1 :])
  second = "".join(second)
  print(first , second)
  print(turn)
  if first == second:
    if turn % 2 == 0:
      print("First")
      break
    else:
      print("Second")
      break
  else:
    word = word[1:]
    turn += 1





x = 'abcdefghijklkjihgfedcba'
x = 'abcdefghiihgfedcba'
y = ''

for i in range(len(x) - 1 , -1 , -1):
  y += x[i]

if x == y:
  print(True)
else:
  print(False)

