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.lang.*;
import java.io.*;

public class little_game{
	public static void main(String[] args) {
		InputReader fi = new InputReader(System.in);
		PrintWriter pr = new PrintWriter(System.out);
		int cnt=0;
		String str=fi.readString();
		int len=str.length();
		int [] arr=new int [26];
		for (int i = 0; i <26 ; i++) {
			arr[i]=0;
		}
		for (int i = 0; i <len ; i++) {
			char ch=str.charAt(i);
			arr[ch-'a']++;
		}

		for (int i = 0; i <26 ; i++) {
			if(arr[i]%2!=0)
				cnt++;
		}
		if((cnt!=0)&&(cnt%2==0))
			pr.println("Second");
		else
			pr.println("First");
		pr.close();
	}
}

 class InputReader {
 private InputStream stream;
 private byte[] buf = new byte[8192];
 private int curChar, snumChars;
 private SpaceCharFilter filter;

 public InputReader(InputStream stream) {
 this.stream = stream;
 }

 public int snext() {
 if (snumChars == -1)
 throw new InputMismatchException();
 if (curChar >= snumChars) {
 curChar = 0;
 try {
 snumChars = stream.read(buf);
 } catch (IOException e) {
 throw new InputMismatchException();
 }
 if (snumChars <= 0)
 return -1;
 }
 return buf[curChar++];
 }

 public int nextInt() {
 int c = snext();
 while (isSpaceChar(c))
 c = snext();
 int sgn = 1;
 if (c == '-') {
 sgn = -1;
 c = snext();
 }
 int res = 0;
 do {
 if (c < '0' || c > '9')
 throw new InputMismatchException();
 res *= 10;
 res += c - '0';
 c = snext();
 } while (!isSpaceChar(c));
 return res * sgn;
 }

 public long nextLong() {
 int c = snext();
 while (isSpaceChar(c))
 c = snext();
 int sgn = 1;
 if (c == '-') {
 sgn = -1;
 c = snext();
 }
 long res = 0;
 do {
 if (c < '0' || c > '9')
 throw new InputMismatchException();
 res *= 10;
 res += c - '0';
 c = snext();
 } while (!isSpaceChar(c));
 return res * sgn;
 }

 public int[] nextIntArray(int n) {
 int a[] = new int[n+1];
 for (int i = 1; i <= n; i++)
 a[i] = nextInt();
 return a;
 }

 public String readString() {
 int c = snext();
 while (isSpaceChar(c))
 c = snext();
 StringBuilder res = new StringBuilder();
 do {
 res.appendCodePoint(c);
 c = snext();
 } while (!isSpaceChar(c));
 return res.toString();
 }

 public boolean isSpaceChar(int c) {
 if (filter != null)
 return filter.isSpaceChar(c);
 return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
 }

 public interface SpaceCharFilter {
 public boolean isSpaceChar(int ch);
 }
 }