#include <bits/stdc++.h>
using namespace std;
int n, k, x, i, y, p, ans = 0, kenti, luwi;
string t;
int a[1001];
int main() {
  cin >> t;
  for (i = 0; i < t.length(); i++) a[t[i] - 'a' + 1]++;
  for (i = 1; i <= 26; i++)
    if (a[i] % 2 == 1)
      kenti++;
    else if (a[i] != 0)
      luwi++;
  int n = t.length();
  if ((n % 2 == 1 && kenti == 1) || (n % 2 == 0 && kenti == 0)) {
    cout << "First";
    return 0;
  }
  if (n % 2 == 0)
    cout << "Second";
  else
    cout << "First";
  return 0;
  return 0;
}
