#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1000000000000000000LL;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T k) {
  return k >= 0 ? k : -k;
}
template <class T>
T sqr(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
T powmod(T a, T b, T c) {
  return b ? sqr((long long)powmod(a, b >> 1, c)) % c * (b & 1 ? a : 1) % c : 1;
}
template <class T>
void mode(T &a, T b) {
  a = mod(a, b);
}
template <class T>
void maxe(T &a, T b) {
  a = max(a, b);
}
template <class T>
void mine(T &a, T b) {
  a = min(a, b);
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 1111111;
int test;
int n, m, k, ans;
char s[N];
int can[N], mex[N], g[N];
int t[3];
int getans() {
  int len, res;
  for (int i = 1; i <= n; i++)
    if (can[i]) {
      for (int j = 0; j < 3; j++) swap(can[i - 1 + j], t[j]);
      len = res = 0;
      for (int j = 1; j <= n; j++) {
        if (can[j])
          len++;
        else {
          res ^= g[len];
          len = 0;
        }
      }
      if (res == 0) return i;
      for (int j = 0; j < 3; j++) swap(can[i - 1 + j], t[j]);
    }
  return 0;
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (int i = 2; i < n; i++) can[i] = (s[i - 1] == s[i + 1]);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++)
      mex[g[max(j - 2, 0)] ^ g[max(i - j - 1, 0)]] = i;
    for (int j = 0;; j++)
      if (mex[j] != i) {
        g[i] = j;
        break;
      }
  }
  ans = getans();
  if (ans)
    printf("First\n%d\n", ans);
  else
    printf("Second\n");
  return 0;
}
