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.

Input

The input contains a single line, containing string s (1 ≤ |s| ≤ 103). String s consists of lowercase English letters.

Output

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.

Examples

Input

aba


Output

First


Input

abca


Output

Second

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashSet;
import java.util.Scanner;
import java.util.StringTokenizer;

public class a {
	static int dp[][][];
	static PrintWriter out;

	public static void main(String[] args) {
		FastReader input = new FastReader();
		Scanner sc = new Scanner(System.in);
		out = new PrintWriter(System.out);
		
		// (2 avsar vora) will not work as input
		String s = input.next();
		HashSet<Character> set = new HashSet<>();
		for(int i=0;i<s.length();i++) {
			if(set.contains(s.charAt(i)))
				set.remove(s.charAt(i));
			else
				set.add(s.charAt(i));		
		}
		if(set.size()%2 != 0 || set.size() == 0)
			out.println("First");
		else if(set.size() != 0)
			out.println("Second");
		out.close();
	}
	
	public static boolean isPali(String s)
	{
		if(s.length()%2 == 0)
			return false;
		int j = s.length()-1;
		for(int i=0;i<s.length();i++) {
			if(s.charAt(i) != s.charAt(j))
				return false;
			j--;
		}
		return true;
	}
	
	public static int isAriProg(ArrayList<Integer> list)
	{
		if(list.size() == 1)
			return 0;
		
		int diff = list.get(1) - list.get(0);
		if(list.size() == 2)
			return diff;
		int st = list.get(0);
		for(int i=1;i<list.size();i++) {
			st += diff;
			if(list.get(i) != st)
				return -1;
		}
		return diff;
	}

	public static int giveMinDiff(int sum,ArrayList<Integer> list,int n) {
		
		int min = Integer.MAX_VALUE;
		
//		out.println(list);
		
		boolean[][] dp = subsetSum(list,sum,n);
		
//		for(int i=0;i<n+1;i++)
//		{
//			for(int j=0;j<sum+1;j++)
//			{
//				out.print(dp[i][j] + " ");
//			}
//			out.println();
//		}
		
		for(int i=0;i<=(sum+1)/2;i++) {
			if(dp[n][i] == true)
				min = Math.min(min, sum - 2*i);
		}
		return min;
	}
	
	public static boolean[][] subsetSum(ArrayList<Integer> list,int sum,int n)
	{
		boolean [][]dp = new boolean[n+1][sum+1];
		for(int i=0;i<dp.length;i++)
			dp[0][i] = false;
		for(int i=0;i<n+1;i++)
			dp[i][0] = true;
		
		for(int i=1;i<n+1;i++)
		{
			for(int j=1;j<sum+1;j++)
			{
				if(list.get(i-1) <= j) {
					dp[i][j] = dp[i-1][j-list.get(i-1)] || dp[i-1][j];
				}
				else {
					dp[i][j] = dp[i-1][j];
				}
			}
		}
		
		return dp;
	}
	
	
	public static long gcd(long a,long b)
	{
		if(b == 0)
			return a;
		return gcd(b,a%b);
	}
	
	public static long gcdArray(long[] arr)
	{
		long res = 0;
		for(int i=0;i<arr.length;i++)
		{
			res = gcd(res,arr[i]);
			if(res == 1)
				return 1;
		}
		return res;
	}
}

class comp implements Comparator<pair>
{

	@Override
	public int compare(pair a, pair b) {
		// TODO Auto-generated method stub
		return a.x - b.x;
	}
	
}

class pair{
	int x;
	int y;
}

class FastReader {
	BufferedReader br;
	StringTokenizer st;

	public FastReader() {
		br = new BufferedReader(new InputStreamReader(System.in));
	}

	String next() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

	int nextInt() {
		return Integer.parseInt(next());
	}

	long nextLong() {
		return Long.parseLong(next());
	}

	double nextDouble() {
		return Double.parseDouble(next());
	}

	String nextLine() {
		String str = "";
		try {
			str = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		return str;
	}
}
