#include<bits/stdc++.h>

#define LL long long

using namespace std;

int main()
{
    string s;
    cin >> s;
    int l = s.length();
    int dp[l+1][l+1];
    memset(dp,0,sizeof(dp));
    for(int i = 0; i < l; i++)
        dp[i][i] = 1;
    for(int i = 2; i <= l; i++)
    {
        for(int j = 0; j < l-i+1; j++)
        {
            int k = i+j-1;
            if(s[j] == s[k])
            {
                dp[j][k] = 2+dp[j+1][k-1];
            }
            else
            {
                dp[j][k] = max(dp[j+1][k],dp[j][k-1]);
            }
        }
    }
    int ans = abs(l-dp[0][l-1]);
    if(ans&1)
    {
        cout << "Second\n";
    }
    else
    {
        cout << "First\n";
    }
    return 0;
}