#include <bits/stdc++.h>
using namespace std;
template <class F, class T>
T convert(F a, int p = -1) {
  stringstream ss;
  if (p >= 0) ss << fixed << setprecision(p);
  ss << a;
  T r;
  ss >> r;
  return r;
}
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T cube(T x) {
  return x * x * x;
}
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
  if (rsz <= 0) {
    ptr = 0;
    rsz = (int)fread(bf, 1, bfsz, stdin);
    if (rsz <= 0) return EOF;
  }
  --rsz;
  return bf[ptr++];
}
void ga(char &c) {
  c = EOF;
  while (!isalpha(c)) c = gc();
}
int gs(char s[]) {
  int l = 0;
  char c = gc();
  while (isspace(c)) c = gc();
  while (c != EOF && !isspace(c)) {
    s[l++] = c;
    c = gc();
  }
  s[l] = '\0';
  return l;
}
template <class T>
bool gi(T &v) {
  v = 0;
  char c = gc();
  while (c != EOF && c != '-' && !isdigit(c)) c = gc();
  if (c == EOF) return false;
  bool neg = c == '-';
  if (neg) c = gc();
  while (isdigit(c)) {
    v = v * 10 + c - '0';
    c = gc();
  }
  if (neg) v = -v;
  return true;
}
const double PI = acos(-1.0);
const double eps = 1e-9;
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e17 + 5;
const long long mod = 10003;
int f[5005], r[5005 * 2];
string s;
int n;
int check() {
  vector<int> V;
  int run = 0;
  for (int i = (1); i <= (n - 2); ++i) {
    if (r[i])
      run++;
    else {
      if (run) V.push_back(run);
      run = 0;
    }
  }
  if (run) V.push_back(run);
  int XO = 0;
  for (int i = 0; i < (((int)(V).size())); ++i) {
    XO ^= f[V[i]];
  }
  return XO;
}
int main() {
  f[0] = 0;
  f[1] = 1;
  f[2] = 1;
  for (int i = (3); i <= (5005 - 1); ++i) {
    memset(r, 0, sizeof(r));
    r[f[i - 2]] = 1;
    for (int j = (0); j <= (i - 3); ++j) {
      r[f[j] ^ f[i - j - 3]] = 1;
    }
    for (int j = 0;; j++)
      if (!r[j]) {
        f[i] = j;
        break;
      }
  }
  cin >> s;
  n = s.length();
  memset(r, 0, sizeof(r));
  for (int i = (1); i <= (n - 2); ++i) {
    if (s[i - 1] == s[i + 1]) r[i] = 1;
  }
  if (!check()) {
    cout << "Second" << endl;
    return 0;
  } else
    cout << "First" << endl;
  for (int i = (1); i <= (n - 2); ++i)
    if (r[i]) {
      int t1 = r[i - 1], t2 = r[i], t3 = r[i + 1];
      r[i - 1] = 0;
      r[i] = 0;
      r[i + 1] = 0;
      if (!check()) {
        cout << i + 1;
        return 0;
      } else {
        r[i - 1] = t1;
        r[i] = t2;
        r[i + 1] = t3;
      }
    }
  return 0;
}
