#include <bits/stdc++.h>
using namespace std;
int N;
char S[6000];
bool m[6000];
int nimval[6000];
bool used[6000];
int nd, np, fd, fp;
int nv() {
  int ans = 0;
  for (int i = 0; i < N; i++) {
    while (i < N && !m[i]) i++;
    int x = 0;
    while (i < N && m[i]) i++, x++;
    ans ^= nimval[x];
  }
  return ans;
}
int main() {
  scanf("%s", S);
  N = strlen(S);
  for (int i = 1; i < N - 1; i++)
    if (S[i - 1] == S[i + 1]) m[i] = 1;
  nimval[0] = 0;
  nimval[1] = 1;
  nimval[2] = 1;
  nimval[3] = 2;
  for (int i = 4; i < N; i++) {
    fill(used, used + N, 0);
    used[nimval[i - 2]] = 1;
    for (int j = 0; j < i - 3; j++) used[nimval[j] ^ nimval[i - 3 - j]] = 1;
    int x = 0;
    while (used[x]) x++;
    nimval[i] = x;
  }
  if (nv() == 0)
    printf("Second\n");
  else {
    printf("First\n");
    for (int i = 1; i < N - 1; i++) {
      if (!m[i]) continue;
      bool o1 = m[i - 1];
      bool o2 = m[i + 1];
      m[i - 1] = m[i] = m[i + 1] = 0;
      if (!nv()) {
        printf("%d\n", i + 1);
        return 0;
      }
      m[i] = 1;
      m[i - 1] = o1;
      m[i + 1] = o2;
    }
  }
}
