#include <bits/stdc++.h>
const int MaxN = 5050;
template <class t>
inline void read(t &s) {
  s = 0;
  register int f = 1;
  register char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar();
  s *= f;
  return;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0) putchar('-'), x = -x;
  int buf[21], top = 0;
  while (x) buf[++top] = x % 10, x /= 10;
  if (!top) buf[++top] = 0;
  while (top) putchar(buf[top--] ^ '0');
  return;
}
inline void setIn(std::string s) {
  freopen(s.c_str(), "r", stdin);
  return;
}
inline void setOut(std::string s) {
  freopen(s.c_str(), "w", stdout);
  return;
}
inline void setIO(std::string s = "") {
  setIn(s + ".in");
  setOut(s + ".out");
  return;
}
template <class t>
inline bool checkmin(t &x, t y) {
  if (x > y) {
    x = y;
    return 1;
  }
  return 0;
}
template <class t>
inline bool checkmax(t &x, t y) {
  if (x < y) {
    x = y;
    return 1;
  }
  return 0;
}
inline int lowbit(int x) { return x & (-x); }
int f[MaxN], n;
char s[MaxN];
inline int dfs(int n) {
  if (n <= 0) return 0;
  if (~f[n]) return f[n];
  bool vis[MaxN];
  std::memset(vis, 0, sizeof vis);
  for (int k = 1; k <= n; ++k) vis[dfs(k - 2) ^ dfs(n - k - 1)] = 1;
  f[n] = 0;
  while (vis[f[n]]) ++f[n];
  return f[n];
}
inline int calc(int l, int r) {
  if (l > r) return 0;
  std::vector<int> dr;
  register int cnt = 0;
  for (int i = l + 1; i < r; ++i)
    if (s[i - 1] == s[i + 1])
      ++cnt;
    else if (cnt)
      dr.push_back(cnt), cnt = 0;
  if (cnt) dr.push_back(cnt);
  register int ans = 0;
  for (auto i : dr) ans ^= dfs(i);
  return ans;
}
signed main(void) {
  std::memset(f, -1, sizeof f);
  std::scanf("%s", s + 1);
  n = std::strlen(s + 1);
  if (!calc(1, n)) return std::puts("Second"), 0;
  std::puts("First");
  for (int i = 1; i <= n; ++i)
    if (s[i - 1] == s[i + 1] && !(calc(1, i - 1) ^ calc(i + 1, n)))
      return write(i), std::puts(""), 0;
  return 0;
}
