Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
public class Exp{
	// static boolean[] prime=getAllPrime(1000000+1);
	public static void main(String[] args) {
		FastReader sc=new FastReader();
		int[] letters = new int[26];
		String str=sc.next();
        char[] s = str.toCharArray();
        int odd = 0;
        for (int i = 0; i < s.length; i++)
            letters[s[i] - 97]++;
        for (int i = 0; i < letters.length; i++)
            if (letters[i] % 2 == 1)
                odd++;
        if (odd <= 1)
           System.out.println("First");
        else {
            odd--;
            System.out.println(odd % 2 == 0 ? "First" : "Second");
        }
	}


	static int ceil(int x, int y) {
		return (x % y == 0 ? x / y : (x / y + 1));
	}

	static long ceil(long x, long y) {
		return (x % y == 0 ? x / y : (x / y + 1));
	}

	public static boolean[] getAllPrime(int n){
		boolean[] prime=new boolean[n+1];
		for(int i=3;i<=n;i+=2){
			prime[i]=true;
		}
		for(int i=3;i*i<=n;i++){
			if(prime[i]==true){
				for(int j=i*i;j<=n;j+=i){
					prime[j]=false;
				}
			}
		}
		prime[2]=true;
		prime[0]=prime[1]=false;
		return prime;
	}

	public static boolean isPrime(long n){
	    if(n<2) return false;
	    for(int i=2;i*i<=n;i++){
	    	if(n%i==0) return false;
	    } 
	    return true;
	}

	public static long gcd(long a, long b){
        if(b==0) return a;
        return gcd(b,a%b);
	}

	public static long lcm(long a, long b){
		long d=gcd(a,b);
		return (a*b)/d;
	}

	public static String swapStringChar(String s, int i, int l){
		StringBuilder sb=new StringBuilder(s);
        sb.setCharAt(i,s.charAt(l));
        sb.setCharAt(l,s.charAt(i));
        return sb.toString();
	}

	public static long pow(long a, long b){
		long res=1;
		while(b>0){
			if((b&1)!=0){
				res=(res * a);
			}
			a=a*a;
			b=b>>1;
		}
		return res;
	}

	public static String catoString(char[] ch){
		StringBuilder sb=new StringBuilder();
		for(int i=0;i<ch.length;i++){
			sb.append(ch[i]);
		}
		return sb.toString();
	}

	static 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;
		}
	}
}