#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b, long long* x, long long* y);
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first > b.first)
    return true;
  else if (a.first == b.first) {
    return (a.second < b.second);
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  string second;
  cin >> second;
  map<char, long long> m;
  for (long long i = 0; i < second.size(); i++) {
    m[second[i]]++;
  }
  long long count = 0;
  for (auto itr = m.begin(); itr != m.end(); itr++) {
    if ((itr->second) % 2 != 0) count++;
  }
  if (count == 0) {
    cout << "First" << endl;
    return 0;
  }
  if (count % 2 == 0) {
    cout << "Second" << endl;
  } else {
    cout << "First" << endl;
  }
  return 0;
}
long long gcd(long long a, long long b, long long* x, long long* y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long x1, y1;
  long long g = gcd(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return g;
}
