#include <bits/stdc++.h>
using namespace std;
int grundy[5001];
int has[2501];
char tmp[5010];
int g[2501];
int top = 0;
int main() {
  grundy[1] = 1;
  grundy[2] = 1;
  for (int i = 3; i <= 5000; i++) {
    for (int j = 1; j <= i; j++) {
      int l = j - 2, r = i - j - 1;
      if (l < 0) l = 0;
      if (r < 0) r = 0;
      has[grundy[l] ^ grundy[r]] = i;
    }
    for (int j = 0; j <= 5000; j++) {
      if (has[j] < i) {
        grundy[i] = j;
        break;
      }
    }
  }
  scanf("%s", tmp);
  int sum = 0;
  int cnt = 0;
  int sz = strlen(tmp);
  for (int i = 1; i + 1 < sz; i++) {
    if (tmp[i - 1] == tmp[i + 1]) {
      cnt++;
    } else {
      if (cnt != 0) g[top++] = cnt;
      sum ^= grundy[cnt];
      cnt = 0;
    }
  }
  if (cnt != 0) g[top++] = cnt;
  sum ^= grundy[cnt];
  if (sum == 0) {
    printf("Second");
  } else {
    printf("First\n");
    int gnow = 0;
    int cntnow = 0;
    for (int i = 1; i + 1 < sz; i++) {
      if (tmp[i - 1] == tmp[i + 1]) {
        cntnow++;
        int s = g[gnow];
        int l = cntnow - 2, r = g[gnow] - cntnow - 1;
        if (l < 0) l = 0;
        if (r < 0) r = 0;
        int S = sum ^ grundy[g[gnow]] ^ grundy[l] ^ grundy[r];
        if (S == 0) {
          printf("%d\n", i + 1);
          return 0;
        }
      }
      if (cntnow == g[gnow]) {
        cntnow = 0;
        gnow++;
      }
    }
  }
}
