#include <bits/stdc++.h>
using namespace std;
int g[5010];
bool a[20];
string s;
bool same[5010];
bool check(int x) {
  int N = s.length(), ans = 0, len = 0, i;
  for ((i) = 0; (i) < (int)(N); (i)++) {
    if (same[i] && abs(i - x) > 1) {
      len++;
    } else {
      ans ^= g[len];
      len = 0;
    }
  }
  return (ans == 0);
}
int main(void) {
  int i, j;
  g[0] = 0;
  for (i = 1; i < 5010; i++) {
    for ((j) = 0; (j) < (int)(20); (j)++) a[j] = false;
    for ((j) = 0; (j) < (int)(i); (j)++)
      a[g[max(j - 1, 0)] ^ g[max(i - 1 - j - 1, 0)]] = true;
    for (j = 0;; j++)
      if (!a[j]) break;
    g[i] = j;
  }
  cin >> s;
  int N = s.length();
  for ((i) = 0; (i) < (int)(N); (i)++)
    if (i - 1 >= 0 && i + 1 < N && s[i - 1] == s[i + 1]) same[i] = true;
  for ((i) = 0; (i) < (int)(N); (i)++)
    if (same[i] && check(i)) {
      cout << "First" << endl << i + 1 << endl;
      return 0;
    }
  cout << "Second" << endl;
  return 0;
}
