#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1E9;
int sg[5005], occur[5005], good[5005], sg2[5005];
char str[5005];
int main() {
  cin >> str;
  sg[1] = 1;
  for (int i = (2); i < (5005); i++) {
    memset(occur, 0, sizeof(occur));
    for (int m = (0); m < (i); m++) {
      int l = max(m - 1, 0), r = max(i - 2 - m, 0);
      occur[sg[l] ^ sg[r]] = 1;
    }
    for (int v = (0); v < (5005); v++)
      if (!occur[v]) {
        sg[i] = v;
        break;
      }
  }
  int N = strlen(str);
  for (int i = (1); i < (N - 1); i++)
    if (str[i - 1] == str[i + 1]) good[i] = 1;
  for (int i = (1); i < (N - 1); i++) {
    if (!good[i]) continue;
    int g = 0;
    for (int j = (1); j < (i - 1); j++) {
      if (!good[j]) continue;
      int k = j;
      while (k < i - 1 && good[k]) k++;
      g ^= sg[k - j];
      j = k - 1;
    }
    for (int j = (i + 2); j < (N - 1); j++) {
      if (!good[j]) continue;
      int k = j;
      while (k < N - 1 && good[k]) k++;
      g ^= sg[k - j];
      j = k - 1;
    }
    if (!g) return printf("First\n%d\n", i + 1), 0;
  }
  puts("Second");
  return 0;
}
