#include <bits/stdc++.h>
using namespace std;
int n, sg[5010];
char s[5010];
bool vis[5010];
void init() {
  sg[0] = 0;
  int i, j;
  for (i = 1; i <= (int)(5000); ++i) {
    memset(vis, 0, sizeof(vis));
    for (j = 1; j <= (int)(i); ++j)
      vis[sg[max(0, j - 2)] ^ sg[max(0, i - j - 1)]] = 1;
    for (j = 0; j < (int)(5000); ++j)
      if (!vis[j]) break;
    sg[i] = j;
  }
}
bool check(int x) {
  int p = 0;
  int c = 0;
  int i;
  for (i = 2; i < x - 1; ++i) {
    if (s[i - 1] == s[i + 1])
      ++c;
    else {
      p ^= sg[c];
      c = 0;
    }
  }
  p ^= sg[c];
  c = 0;
  for (i = x + 2; i < n; ++i) {
    if (s[i - 1] == s[i + 1])
      ++c;
    else {
      p ^= sg[c];
      c = 0;
    }
  }
  p ^= sg[c];
  return p == 0;
}
int main() {
  init();
  cin >> (s + 1);
  n = strlen(s + 1);
  int i;
  int p = 0;
  int c = 0;
  for (i = 2; i < n; ++i) {
    if (s[i - 1] == s[i + 1])
      ++c;
    else {
      p ^= sg[c];
      c = 0;
    }
  }
  p ^= sg[c];
  if (p) {
    puts("First");
    for (i = 2; i < n; ++i)
      if (s[i - 1] == s[i + 1] && check(i)) {
        printf("%d\n", i);
        break;
      }
  } else
    puts("Second");
  return 0;
}
