#include <bits/stdc++.h>
using namespace std;
char s[5005];
int sg[5005];
bool g[5005];
int ans;
int dfs(int n) {
  if (n <= 0) return 0;
  if (n == 1) return 1;
  if (~sg[n]) return sg[n];
  bool vis[105];
  memset(vis, 0, sizeof(vis));
  int i;
  for (i = 1; i <= n; i++) vis[dfs(i - 2) ^ dfs(n - i - 1)] = 1;
  for (i = 0;; i++)
    if (!vis[i]) return sg[n] = i;
}
int main() {
  memset(sg, -1, sizeof(sg));
  scanf("%s", s);
  int len = strlen(s), i, j;
  for (i = 1; i < len - 1; i++)
    if (s[i - 1] == s[i + 1]) g[i] = 1;
  for (i = 0; i < len; i++)
    if (g[i]) {
      j = i;
      int c = 0;
      while (g[j]) j++, c++;
      i = j - 1;
      ans ^= dfs(c);
    }
  if (ans) {
    puts("First");
    for (int k = 1; k < len - 1; k++)
      if (g[k]) {
        int x = g[k - 1], y = g[k + 1];
        g[k - 1] = g[k] = g[k + 1] = 0;
        ans = 0;
        for (i = 0; i < len; i++)
          if (g[i]) {
            j = i;
            int c = 0;
            while (g[j]) j++, c++;
            i = j - 1;
            ans ^= dfs(c);
          }
        if (!ans) {
          printf("%d\n", k + 1);
          return 0;
        }
        g[k] = 1;
        g[k - 1] = x;
        g[k + 1] = y;
      }
  } else
    puts("Second");
  return 0;
}
