#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int nim[N];
int main() {
  for (int i = 1; i < N; ++i) {
    vector<bool> taken(N);
    for (int j = 0; j < i; ++j) {
      int s1 = max(j - 1, 0);
      int s2 = max(i - j - 2, 0);
      taken[nim[s1] ^ nim[s2]] = true;
    }
    for (int j = 0; j < N; ++j)
      if (!taken[j]) {
        nim[i] = j;
        break;
      }
  }
  string s;
  cin >> s;
  int n = s.size();
  s += "!";
  vector<int> mysize(n);
  vector<int> s1(n);
  vector<int> s2(n);
  int ans = 0;
  for (int i = 1; i < n;) {
    if (s[i - 1] != s[i + 1]) {
      ++i;
      continue;
    }
    int j = i;
    while (s[j - 1] == s[j + 1]) ++j;
    ans ^= nim[j - i];
    for (int k = i; k < j; ++k) {
      mysize[k] = j - i;
      s1[k] = max((k - i) - 1, 0);
      s2[k] = max((j - i) - (k - i) - 2, 0);
    }
    i = j;
  }
  if (!ans) {
    puts("Second");
    return 0;
  }
  puts("First");
  for (int i = 0; i < n; ++i) {
    if (mysize[i] == 0) continue;
    int change = nim[mysize[i]] ^ nim[s1[i]] ^ nim[s2[i]];
    if (change == ans) {
      cout << i + 1 << '\n';
      return 0;
    }
  }
}
