#include <bits/stdc++.h>
using namespace std;
const int MAX_LEN = 5005;
int mex[MAX_LEN];
void pre() {
  mex[0] = mex[1] = mex[2] = 0;
  for (int i = 3; i < MAX_LEN; i++) {
    set<int> s;
    for (int left = 1; left < i - 1; left++) {
      s.insert(mex[left] ^ mex[i - left - 1]);
    }
    mex[i] = 0;
    for (auto it : s) {
      if (it == mex[i]) {
        mex[i]++;
      } else {
        break;
      }
    }
  }
}
int solve(string s) {
  int sg = 0;
  int counter = 0;
  for (int i = 1; i < (int)s.size() - 1; i++) {
    if (s[i - 1] == s[i + 1]) {
      counter++;
    } else {
      sg ^= mex[counter + 2];
      counter = 0;
    }
  }
  sg ^= mex[counter + 2];
  return sg;
}
int main(void) {
  string s;
  pre();
  cin >> s;
  int sg = solve(s);
  if (sg == 0) {
    printf("Second\n");
  } else {
    printf("First\n");
    for (int i = 1; i < (int)s.size() - 1; i++) {
      if (s[i - 1] == s[i + 1]) {
        int aux = solve(s.substr(0, i)) ^
                  solve(s.substr(i + 1, (int)s.size() - (i + 1)));
        if (aux == 0) {
          printf("%d\n", i + 1);
          break;
        }
      }
    }
  }
  return 0;
}
