1.4 Little Girl
(RankList for this Question)
Score: 15pts
Time Limit: 5.00 sec
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.

Constraints
1 ≤ |s|  ≤  10^3

Input Format
The input contains a single line, containing string s . String s consists of lowercase English letters.

Output Format
In a single line print word "First" if the first player wins (provided that both players play optimally well). Otherwise, print word "Second". Print the words without the quotes.

Example 1
Input:
aba

Output:
First

Explanation:
So lets say player 1 removed any b as need to play optimally so remaining string is s="ab" or "ba" so its not a palindrome so now player 2 need to remove a character lets say removes "b" so string is s="a" so this is a palindrome so player 1 wins so we will print "First"