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 static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Short.parseShort;
import static java.lang.Byte.parseByte;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Contest {

    static int nextInt() throws IOException {
        return parseInt(next());
    }

    static long nextLong() throws IOException {
        return parseLong(next());
    }

    static short nextShort() throws IOException {
        return parseShort(next());
    }

    static byte nextByte() throws IOException {
        return parseByte(next());
    }

    static String next() throws IOException {
        while (tok == null || !tok.hasMoreTokens())
            tok = new StringTokenizer(in.readLine());
        return tok.nextToken();
    }

    static String nextLine() throws IOException {
        return in.readLine();
    }

    private static BufferedReader in;
    private static StringTokenizer tok;
    private static PrintWriter out = new PrintWriter(System.out);
    private static Utilities doThis = new Utilities();

    public static void main(String[] args) throws Exception {
        in = new BufferedReader(new InputStreamReader(System.in));

        /*--------------------SolutionStarted-------------------*/
        solve();
        /*--------------------SolutionEnded--------------------*/

        in.close();
        out.close();
    }

    static void solve() throws IOException {
        int[] letters = new int[26];
        char[] s = next().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)
            out.println("First");
        else {
            odd--;
            out.println(odd % 2 == 0 ? "First" : "Second");
        }
    }
}
class IntPair implements Comparable<IntPair> {
    int teamID, points;

    IntPair(int teamID, int points) {
        this.teamID = teamID;
        this.points = points;
    }

    @Override
    public int compareTo(IntPair o) {
        if (teamID == o.teamID)
            return 0;
        if (points == o.points)
            return o.teamID - teamID;
        return points - o.points;
    }

    public String toString() {
        return teamID + " " + points;
    }
}
class CharPair{
    char c;
    boolean flag;
    CharPair(char c, boolean flag){
        this.c = c;
        this.flag = flag;
    }
}
class BooleanPair {
    boolean key, value;

    BooleanPair() {
    }

    BooleanPair(boolean key, boolean value) {
        this.key = key;
        this.value = value;
    }
}
class Utilities {
    //int arrays start
    int lowerBound(int[] arr, int low, int high, int element) {
        int middle;
        while (low < high) {
            middle = low + (high - low) / 2;
            if (element > arr[middle])
                low = middle + 1;
            else
                high = middle;
        }
        if (arr[low] < element)
            return -1;
        return low;
    }

    int upperBound(int[] arr, int low, int high, int element) {
        int middle;
        while (low < high) {
            middle = low + (high - low) / 2;
            if (arr[middle] > element)
                high = middle;
            else
                low = middle + 1;
        }
        if (arr[low] <= element)
            return -1;
        return low;
    }
    //int arrays end
    //long arrays start
    int lowerBound(long[] arr, int low, int high, long element) {
        int middle;
        while (low < high) {
            middle = low + (high - low) / 2;
            if (element > arr[middle])
                low = middle + 1;
            else
                high = middle;
        }
        if (arr[low] < element)
            return -1;
        return low;
    }

    int upperBound(long[] arr, int low, int high, long element) {
        int middle;
        while (low < high) {
            middle = low + (high - low) / 2;
            if (arr[middle] > element)
                high = middle;
            else
                low = middle + 1;
        }
        if (arr[low] <= element)
            return -1;
        return low;
    }
    //long arrays end
    //double arrays start
    int lowerBound(double[] arr, int low, int high, double element) {
        int middle;
        while (low < high) {
            middle = low + (high - low) / 2;
            if (element > arr[middle])
                low = middle + 1;
            else
                high = middle;
        }
        if (arr[low] < element)
            return -1;
        return low;
    }

    int upperBound(double[] arr, int low, int high, double element) {
        int middle;
        while (low < high) {
            middle = low + (high - low) / 2;
            if (arr[middle] > element)
                high = middle;
            else
                low = middle + 1;
        }
        if (arr[low] <= element)
            return -1;
        return low;
    }
    //double arrays end
}
/*int t = nextInt(), teamID , points, q, winner;
        TreeSet<IntPair> events;
        Map<Integer, Integer> teams;
        IntPair maxEvent = new IntPair(Integer.MIN_VALUE, Integer.MIN_VALUE), event;
        while(t-->0){
            winner = 0;
            teams = new HashMap<>(nextInt());
            events = new TreeSet<>();
            q = nextInt();
            for (int i = 1; i <= q ; i++) {
                teamID = nextInt();
                points = nextInt();
                if(teams.containsKey(teamID)){
                    events.remove(new IntPair(teamID,teams.get(teamID)));
                    points += teams.get(teamID);
                    teams.remove(teamID);
                    teams.put(teamID,points);
                    events.add(new IntPair(teamID, points));
                    event = events.last();
                    if (maxEvent.points<event.points){
                        if (maxEvent.teamID!=event.teamID) {
                            maxEvent = event;
                            winner = i;
                        }
                    }
                }else{
                    events.add(new IntPair(teamID, points));
                    teams.put(teamID, points);
                    event = events.last();
                    if (maxEvent.points<event.points){
                        if (maxEvent.teamID!=event.teamID) {
                            maxEvent = event;
                            winner = i;
                        }
                    }
                }
            }
            out.println(winner);
        }
        events = new TreeSet<>();
        teams = new HashMap<>();
        for (int i = 0; i < t; i++) {
            teamID = nextInt(); points = nextInt();
            if(teams.containsKey(teamID)) {
                event = new IntPair(teamID, teams.remove(teamID));
                events.remove(event);
                events.add(new IntPair(teamID, points));
            }else {
                teams.put(teamID,points);
                events.add(new IntPair(teamID, points));
            }
        }
        Iterator<IntPair> i = events.iterator();
        while (i.hasNext())
            out.println(i.next());*/