#include <bits/stdc++.h>   using namespace std;   void solve() {     string s;     cin >> s;     int arr[26] = {};     int n = s.length();     int count = 0;     for (int i = 0; i < n; i++) {       arr[s[i] -  a ]++;       if (arr[s[i] -  a ] == 2) {         arr[s[i] -  a ] = 0;         count--;       } else         count++;     }     if (count == 0 || count == 1) {       cout <<  First             <<   n ;     } else {       if (count % 2 == 0) {         cout <<  Second               <<   n ;       } else         cout <<  First               <<   n ;     }   }   int main() {     long long t = 1;     while (t--) solve();   }   