#include <bits/stdc++.h>
using namespace std;
const int MAX = 5010;
int N;
char str[MAX];
int SG[MAX], mex[MAX], tot;
bool check(int x) {
  int lo = x, hi = x;
  while (lo > 0 && str[lo - 1] == str[lo + 1]) lo--;
  while (hi < N - 1 && str[hi - 1] == str[hi + 1]) hi++;
  int i = hi - lo - 1, j = x - lo;
  int ret = tot ^ SG[i];
  ret ^= SG[max(j - 2, 0)] ^ SG[max(i - j - 1, 0)];
  return ret == 0;
}
int main() {
  scanf("%s", str);
  N = strlen(str);
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= i; j++)
      mex[SG[max(j - 2, 0)] ^ SG[max(i - j - 1, 0)]] = i;
    while (mex[SG[i]] == i) SG[i]++;
  }
  for (int i = 1; i < N - 1; i++)
    if (str[i - 1] == str[i + 1]) {
      int j = i;
      while (j < N - 1 && str[j - 1] == str[j + 1]) j++;
      tot ^= SG[j - i];
      i = j;
    }
  if (!tot) {
    printf("Second\n");
    return 0;
  }
  for (int i = 1; i < N - 1; i++)
    if (str[i - 1] == str[i + 1] && check(i)) {
      printf("First\n%d\n", i + 1);
      break;
    }
  return 0;
}
