#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int oo = (int)1e9;
const long long OO = (long long)1e18;
const double PI = acos(-1.0);
const int N = (int)1e5 + 9;
bool prime[N];
bool isprime(int n) {
  if (n <= 1) return 0;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return prime[n] = true;
}
void feilprime() {
  prime[0] = prime[1] = 0;
  for (int i = 2; i * i <= 100009; i++) {
    if (isprime(i))
      for (int j = i + i; j < 100009; j += i) prime[j] = 0;
  }
}
int a[26];
char h[1100];
int main() {
  scanf("%s", h);
  int sz = strlen(h);
  for (int i = 0; i < sz; i++) a[h[i] - 'a']++;
  int c = 0;
  bool e = 0;
  for (int i = 0; i < 26; i++) {
    if (a[i] % 2 == 1 && !e)
      e = 1;
    else if (a[i] % 2 == 1)
      c++;
  }
  printf((c % 2 == 0) ? "First\n" : "Second\n");
  return 0;
}
