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.
#include<bits/stdc++.h>
#define FOR(i,s,e) for (int i=(s); i<(e); i++)
#define FOE(i,s,e) for (int i=(s); i<=(e); i++)
using namespace std;
int abc_count[30];

int main(){
	string word;
	cin>>word;
	int lend = word.size();
	FOR(i,0,lend){
		abc_count[word[i]-'a'] += 1;
	}
	
	int impar=0;
	FOR(i,0,26) {
    if(abc_count[i]%2!=0){
    	impar += 1;
    }
  }
	if (impar == 0 || impar & 1){
		cout<<"First"<<endl;
	}
	else{
		cout<<"Second"<<endl;
	}
	return 0;
}
