#include <bits/stdc++.h>
using namespace std;
const int N = 5003;
int sg[N];
bool q[N];
char s[N];
int main() {
  sg[0] = 0;
  for (int i = 1; i < N; ++i) {
    memset(q, 0, i * sizeof(bool));
    for (int j = 0; j < i; ++j) {
      int a = max(0, j - 1);
      int b = max(0, i - j - 2);
      q[sg[a] ^ sg[b]] = true;
    }
    int j = 0;
    while (q[j]) ++j;
    sg[i] = j;
  }
  scanf("%s", s);
  vector<int> v;
  int val = 0;
  for (int i = 1, c = 0; s[i]; ++i) {
    if (s[i - 1] == s[i + 1])
      ++c;
    else if (c > 0) {
      v.push_back(i - c);
      v.push_back(c);
      val ^= sg[c];
      c = 0;
    }
  }
  if (val) {
    puts("First");
    for (int j = 0; j < (int)v.size(); j += 2) {
      int i = v[j];
      int c = v[j + 1];
      int x = (val ^ sg[c]);
      for (int k = 0; k < c; ++k) {
        int a = max(0, k - 1);
        int b = max(0, c - k - 2);
        if ((sg[a] ^ sg[b]) == x) {
          printf("%d\n", i + k + 1);
          return 0;
        }
      }
    }
  } else
    puts("Second");
  return 0;
}
