#include <bits/stdc++.h>
using namespace std;
int f[5010];
bool M[5010];
void solve(string &s) {
  vector<int> sg(5005), vis(10010);
  int is_first, n = s.size();
  for (int len = 3; len <= n; len++) {
    for (int i = 1; i <= (len - 1) / 2; i++) {
      vis[sg[i] ^ sg[len - i - 1]] = len;
    }
    for (; vis[sg[len]] == len; sg[len]++)
      ;
  }
  auto calc = [&](int l, int r) {
    if (r - l < 3) return 0;
    int cnt = 0, res = 0;
    for (int i = l + 1; i < r - 1; i++) {
      if (s[i - 1] == s[i + 1]) {
        cnt++;
      } else {
        res ^= sg[cnt + 2];
        cnt = 0;
      }
    }
    return res ^ sg[cnt + 2];
  };
  if (calc(0, s.size())) {
    cout << "First\n";
    for (int i = 1; i < s.size() - 1; i++) {
      if (s[i - 1] == s[i + 1] && calc(0, i) == calc(i + 1, s.size())) {
        cout << i + 1 << "\n";
        break;
      }
    }
  } else {
    cout << "Second\n";
  }
  return;
}
int main() {
  string s;
  cin >> s;
  solve(s);
  return 0;
}
