Two people play the following string game. Initially the players have got some string s. The players move in turns, the player who cannot make a move loses. 

Before the game began, the string is written on a piece of paper, one letter per cell.

<image> An example of the initial situation at s = "abacaba"

A player's move is the sequence of actions:

  1. The player chooses one of the available pieces of paper with some string written on it. Let's denote it is t. Note that initially, only one piece of paper is available. 
  2. The player chooses in the string t = t1t2... t|t| character in position i (1 ≤ i ≤ |t|) such that for some positive integer l (0 < i - l; i + l ≤ |t|) the following equations hold: ti - 1 = ti + 1, ti - 2 = ti + 2, ..., ti - l = ti + l. 
  3. Player cuts the cell with the chosen character. As a result of the operation, he gets three new pieces of paper, the first one will contain string t1t2... ti - 1, the second one will contain a string consisting of a single character ti, the third one contains string ti + 1ti + 2... t|t|. 

<image> An example of making action (i = 4) with string s = «abacaba»

Your task is to determine the winner provided that both players play optimally well. If the first player wins, find the position of character that is optimal to cut in his first move. If there are multiple positions, print the minimal possible one.

Input

The first line contains string s (1 ≤ |s| ≤ 5000). It is guaranteed that string s only contains lowercase English letters.

Output

If the second player wins, print in the single line "Second" (without the quotes). Otherwise, print in the first line "First" (without the quotes), and in the second line print the minimal possible winning move — integer i (1 ≤ i ≤ |s|).

Examples

Input

abacaba


Output

First
2


Input

abcde


Output

Second

Note

In the first sample the first player has multiple winning moves. But the minimum one is to cut the character in position 2. 

In the second sample the first player has no available moves.
import java.io.*;
import java.util.*;

public class E {
	FastScanner in;
	PrintWriter out;

	int stupid(char[] c) {
		int[][] dp = new int[c.length][c.length];
		for (int i = 0; i < c.length; i++) {
			dp[i][i] = 0;
		}
		for (int len = 1; len < c.length; len++) {
			for (int i = 0, j = len; j < c.length; i++, j++) {
				Set<Integer> gg = new HashSet<>();
				for (int k = i + 1; k < j; k++)
					if (c[k - 1] == c[k + 1]) {
						gg.add(dp[i][k - 1] ^ dp[k + 1][j]);
					}
				for (int k = 0;; k++) {
					if (!gg.contains(k)) {
						dp[i][j] = k;
						break;
					}
				}
			}
		}
		if (dp[0][c.length - 1] == 0) {
			return -1;
		}
		for (int i = 1; i < c.length - 1; i++) {
			if (c[i - 1] == c[i + 1]) {
				if ((dp[0][i - 1] ^ dp[i + 1][c.length - 1]) == 0) {
					return i + 1;
				}
			}
		}
		throw new AssertionError();
	}

	Random rand = new Random(123712323L);

	void test() {
		while (true) {
			StringBuilder sb = new StringBuilder();
			int n = rand.nextInt(70) + 1;
			for (int i = 0; i < n; i++) {
				sb.appendCodePoint(rand.nextInt(3) + 'a');
			}
			int ans1 = smart(sb.toString().toCharArray());
			int ans2 = stupid(sb.toString().toCharArray());
			if (ans1 != ans2) {
				System.err.println(ans1 + " " + ans2);
				System.err.println(sb);
				throw new AssertionError();
			}
			System.err.println("OK");
		}
	}

	void solve() throws IOException {
		char[] c = in.next().toCharArray();
		int ans = smart(c);
		out.println(ans < 0 ? "Second" : ("First\n" + ans));
	}

	int smart(char[] c) {
		if (c.length <= 2) {
			return -1;
		}
		boolean[] good = new boolean[c.length - 2];
		for (int i = 1; i < c.length - 1; i++) {
			good[i - 1] = c[i - 1] == c[i + 1];
		}
		List<Integer> lens = new ArrayList<>();
		List<Integer> starts = new ArrayList<>();
		for (int i = 0; i < good.length;) {
			if (!good[i]) {
				i++;
				continue;
			}
			int j = i;
			while (j < good.length && good[j]) {
				j++;
			}
			lens.add(j - i);
			starts.add(i + 1);
			i = j;
		}
		int[] g = new int[c.length + 1];
		int[] used = new int[c.length + 2];
		g[0] = 0;
		for (int i = 1; i <= c.length; i++) {
			for (int j = 0; j < i; j++) {
				int xor = g[Math.max(j - 1, 0)] ^ g[Math.max(0, i - j - 2)];
				if (xor < used.length) {
					used[xor] = i;
				}
			}
			for (int j = 0;; j++) {
				if (used[j] != i) {
					g[i] = j;
					break;
				}
			}
		}
		int ans = 0;
		for (int i : lens) {
			ans ^= g[i];
		}
		if (ans == 0) {
			return -1;
		} else {
			for (int i = 0; i < lens.size(); i++) {
				int curLen = lens.get(i);
				int st = starts.get(i);
				for (int j = 0; j < curLen; j++) {
					int xor = g[Math.max(j - 1, 0)]
							^ g[Math.max(0, curLen - j - 2)];
					if ((ans ^ g[curLen] ^ xor) == 0) {
						return st + j + 1;
					}
				}
			}
		}
		throw new AssertionError();
	}

	public void run() {
		try {
			InputStream inputStream = System.in;
			File inFile = new File("e.in");
			if (inFile.exists() && inFile.canRead()) {
				inputStream = new FileInputStream(inFile);
			}
			in = new FastScanner(inputStream);
			out = new PrintWriter(System.out);
			solve();
			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(239);
		}
	}

	private class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(InputStream is) {
			br = new BufferedReader(new InputStreamReader(is));
		}

		public boolean hasNext() throws IOException {
			while (st == null || !st.hasMoreTokens()) {
				String line = br.readLine();
				if (line == null) {
					return false;
				}
				st = new StringTokenizer(line);
			}
			return true;
		}

		public String next() throws IOException {
			if (hasNext()) {
				return st.nextToken();
			}
			return null;
		}

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

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

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

	public static void main(String[] args) {
		new E().run();
	}
}
