#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int dp[N];
string x;
int main() {
  for (int len = 1; len < N; len++) {
    bitset<N> arr;
    for (int k = 0; k < len; k++) {
      int x1 = 0;
      if (k - 1 >= 0) x1 = dp[k - 1];
      int x2 = 0;
      if (len - k - 2 >= 0) x2 = dp[len - k - 2];
      arr[x1 ^ x2] = 1;
    }
    for (int i = 0; i <= len; i++) {
      if (!arr[i]) {
        dp[len] = i;
        break;
      }
    }
  }
  cin >> x;
  int xr = 0;
  vector<int> vec;
  vector<int> s;
  for (int i = 1; i + 1 < x.size(); i++) {
    if (x[i - 1] != x[i + 1]) continue;
    int j = i;
    while (j + 1 + 1 < x.size() && x[j] == x[j + 2]) j++;
    xr ^= dp[j - i + 1];
    vec.push_back(j - i + 1);
    s.push_back(i);
    i = j;
  }
  for (int i = 0; i < vec.size(); i++) {
    for (int k = 0; k < vec[i]; k++) {
      if ((xr ^ dp[vec[i]] ^ (k - 1 >= 0 ? dp[k - 1] : 0) ^
           (vec[i] - k - 2 >= 0 ? dp[vec[i] - k - 2] : 0)) == 0) {
        puts("First");
        cout << s[i] + k + 1;
        return 0;
      }
    }
  }
  puts("Second");
}
