#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 10;
int n, g[N];
string str;
int calcGrun(int l, int r) {
  int sz = 0;
  vector<int> lens;
  for (int i = l + 1; i < r; i++) {
    if (str[i - 1] == str[i + 1]) {
      sz++;
    } else if (sz > 0) {
      lens.push_back(sz);
      sz = 0;
    }
  }
  if (sz > 0) {
    lens.push_back(sz);
  }
  int grun = 0;
  for (int x : lens) {
    grun ^= g[x];
  }
  return grun;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> str;
  n = str.size();
  for (int i = 1; i <= n; i++) {
    set<int> mex;
    for (int j = 1; j <= i; j++) {
      int ng = 0;
      if (j - 2 >= 0) ng ^= g[j - 2];
      if (i - j - 1 >= 0) ng ^= g[i - j - 1];
      mex.insert(ng);
    }
    g[i] = 0;
    for (int m : mex) {
      if (m != g[i]) break;
      g[i]++;
    }
  }
  if (calcGrun(0, n - 1) == 0) {
    cout << "Second\n";
    return 0;
  }
  cout << "First\n";
  for (int i = 1; i < n - 1; i++) {
    if (str[i - 1] != str[i + 1]) continue;
    int gl = calcGrun(0, i - 1);
    int gr = calcGrun(i + 1, n - 1);
    if ((gl ^ gr) == 0) {
      cout << i + 1 << '\n';
      break;
    }
  }
  return 0;
}
