#include <bits/stdc++.h>
const int N = 5005;
using namespace std;
string s;
int n, f[N], cnt, a[N];
bool ck[N];
void solve(int num) {
  for (int i = 0; i < N; i++) ck[i] = 0;
  for (int i = 2; i <= num + 1; i++) {
    int x = max(i - 3, 0), y = max(num - i, 0);
    ck[f[x] ^ f[y]] = 1;
  }
  for (int i = 0; i < N; i++) {
    if (!ck[i]) {
      f[num] = i;
      break;
    }
  }
}
int cal(int l, int r) {
  int cur = 0, cnt = 0;
  for (int i = l + 1; i < r; i++) {
    if (ck[i]) {
      cnt++;
    } else
      cur ^= f[cnt], cnt = 0;
  }
  cur ^= f[cnt];
  return cur;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  n = s.size();
  s = '.' + s;
  for (int i = 1; i < N; i++) solve(i);
  for (int i = 2; i < n; i++)
    if (s[i - 1] == s[i + 1])
      ck[i] = 1;
    else
      ck[i] = 0;
  for (int i = 2; i < n; i++) {
    if (ck[i] && (cal(1, i - 1) ^ cal(i + 1, n)) == 0) {
      cout << "First\n" << i;
      return 0;
    }
  }
  cout << "Second";
}
