#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <stack>
const int inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

char str[100050];
int len;
int main()
{
    //freopen("input.txt","r",stdin);
    scanf("%s",str+1);
    len=strlen(str+1);
    int head=1,tail=len;
    int win,cnt=0;
    while(true)
    {
        if(tail-head==2)
        {
            if(str[head]==str[tail])
            {
                win=2;
            }
            else
            {
                win=1;
            }
            break;
        }
        if(tail-head==1)
        {
            win=2;
            break;
        }
        //
        if(str[head]==str[tail])
        {
            cnt++;
            head++,tail--;
        }
        else
        {
            head++,tail--;
        }
    }
    //
    if(win==1)
    {
        if(cnt%2==0) printf("First\n");
        else printf("Second\n");
    }
    else
    {
        if(cnt%2==0) printf("Second\n");
        else printf("First\n");
    }
    return 0;
}
