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.io.*;
import java.util.StringTokenizer;
import java.util.*;
import java.math.*; 



// public
class Solution{

  private static BigInteger ncr(int n, int r) {
    BigInteger top = BigInteger.ONE;
    BigInteger bot = BigInteger.ONE;
    if(n==r)
        return top;
    for(int i = n; i >n-r; --i){
        top = top.multiply(BigInteger.valueOf(i));
    }

    for(int i = r; i > 1; --i){
        bot = bot.multiply(BigInteger.valueOf(i));
    }

    return top.divide(bot);
}
   
   public static int getCeil(ArrayList<Integer> A, int x)
    {
        int left = 0, right = A.size() - 1;
 
        int ceil = -1;
 
         while (left <= right)
        {
                int mid = (left + right) / 2;
 
              if (A.get(mid) == x) {
                return A.get(mid);
            }
 
                  else if (x < A.get(mid))
            {
                ceil = A.get(mid);
                right = mid - 1;
            }
 
            else
                left = mid + 1;
        }
 
        return ceil;
    }
     public static int getFloor(ArrayList<Integer> A, int x)
    {
        int left = 0, right = A.size() - 1;
 
        int floor = -1;
       while (left <= right)
        {
              int mid = (left + right) / 2;
 
           if (A.get(mid) == x) {
                return A.get(mid);
            }
 
                else if (x < A.get(mid)) {
                right = mid - 1;
            }
 
          else {
                floor = A.get(mid);
                left = mid + 1;
            }
        }
 
        return floor;
    }
   static ArrayList<Integer> sieveOfEratosthenes(int n) 
    { 
        ArrayList<Integer> arr = new ArrayList<>();
        boolean prime[] = new boolean[n+1]; 
        for(int i=0;i<n;i++) 
            prime[i] = true; 
        
        for(int p = 2; p*p <=n; p++) 
        { 
            if(prime[p] == true) 
            { 
                for(int i = p*p; i <= n; i += p) 
                    prime[i] = false; 
            } 
        }

        for(int i = 2; i <= n; i++) 
        { 
            if(prime[i] == true) 
                arr.add(i);
        } 
        return arr;
    } 
      
      static void merge(int arr[], int l, int m, int r) 
    { 
       
        int n1 = m - l + 1; 
        int n2 = r - m; 

        int L[] = new int [n1]; 
        int R[] = new int [n2]; 
  

        for (int i=0; i<n1; ++i) 
            L[i] = arr[l + i]; 
        for (int j=0; j<n2; ++j) 
            R[j] = arr[m + 1+ j]; 
  
  
        
        int i = 0, j = 0; 
  
       
        int k = l; 
        while (i < n1 && j < n2) 
        { 
            if (L[i] <= R[j]) 
            { 
                arr[k] = L[i]; 
                i++; 
            } 
            else
            { 
                arr[k] = R[j]; 
                j++; 
            } 
            k++; 
        } 
  
    
        while (i < n1) 
        { 
            arr[k] = L[i]; 
            i++; 
            k++; 
        } 
  
        while (j < n2) 
        { 
            arr[k] = R[j]; 
            j++; 
            k++; 
        } 
    } 
  
  
   static void sort(int arr[], int l, int r) 
    { 
        if (l < r) 
        { 
            int m = (l+r)/2; 
  
            sort(arr, l, m); 
            sort(arr , m+1, r); 
  
            merge(arr, l, m, r); 
        } 
    } 
      public static void main(String[] args) throws Exception {
        FastScanner cin = new FastScanner(System.in);
        StringBuffer ans = new StringBuffer(); 
        String str = cin.nextLine();
        ArrayList<Integer> even  =new ArrayList<>();
        ArrayList<Integer> odd = new ArrayList<>();
        int arr[] = new int[26];
        int length = str.length();
        for(int i=0;i<length;i++)
        {
            char c = str.charAt(i);
            arr[c-'a']++;
        }
        for(int i=0;i<26;i++)
        {
            if(arr[i]!=0)
            {
                if(arr[i]%2==0)
                    even.add(arr[i]);
                else
                    odd.add(arr[i]);
            }
        }

        if(odd.size()%2!=0 || odd.size()==0)
            ans.append("First\n");
        else
            ans.append("Second\n");
        System.out.print(ans);
    }
        
    static class FastScanner {
        private BufferedReader reader = null;
        private StringTokenizer tokenizer = null;
 
        public FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }
 
        public String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
 
            return tokenizer.nextToken("\n");
        }
 
        public long nextLong() {
            return Long.parseLong(next());
        }
         
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
    }
  }