#include <bits/stdc++.h>
using namespace std;
int sg[5050];
int f[5050];
char s[5050];
int n;
int search(int l, int r) {
  int tmp = 0;
  int ret = 0;
  for (int i = l + 1; i < r; i++)
    if (s[i - 1] == s[i + 1])
      tmp++;
    else {
      ret ^= sg[tmp];
      tmp = 0;
    }
  ret ^= sg[tmp];
  return ret;
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  memset(sg, 0, sizeof(sg));
  for (int i = 1; i <= n; i++) {
    set<int> appear;
    for (int j = 1; j <= i; j++)
      appear.insert(sg[max(0, j - 2)] ^ sg[max(0, i - j - 1)]);
    int cur = 0;
    while (*appear.begin() == cur) {
      cur++;
      appear.erase(appear.begin());
    }
    sg[i] = cur;
  }
  for (int i = 2; i < n; i++)
    if (s[i - 1] == s[i + 1] && ((search(1, i - 1) ^ search(i + 1, n)) == 0)) {
      printf("First\n");
      printf("%d\n", i);
      return 0;
    }
  printf("Second\n");
  return 0;
}
