#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7, MAX = 1e5 + 5;
long long powN(long long a, long long p) {
  if (p == 0) return 1;
  long long z = powN(a, p / 2);
  z = (z * z) % MOD;
  if (p % 2) z = (z * a) % MOD;
  return z;
}
vector<bool> is_prime(MAX + 1, true);
void Sieve() {
  is_prime[0] = is_prime[1] = false;
  int i, j;
  for (i = 2; i * i <= MAX; i++) {
    if (is_prime[i]) {
      for (j = i * i; j <= MAX; j += i) is_prime[j] = false;
    }
  }
}
int main() {
  string s;
  cin >> s;
  int A[26] = {0};
  for (int i = 0; i < s.length(); i++) {
    A[s[i] - 'a']++;
  }
  int odd = 0;
  for (int i = 0; i < 26; i++) {
    if (A[i] % 2) odd++;
  }
  if (odd == 0 || odd % 2)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
