#include<cstdio>

 #include<iostream>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #define maxn 5005

 using namespace std;

 char ch,s[maxn];

 int n,sg[maxn],l,idx,tmp;

 struct DATA{

     int l,r,siz;

 }list[maxn];

 bool ok,bo[maxn],can[maxn],flag;

 void read(int &x){

     for (ok=,ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') ok=;

     for (x=;isdigit(ch);x=x*+ch-'',ch=getchar());

     if (ok) x=-x;

 }

 void calc(int k){

     for (int i=,t1,t2;i<=k;i++){

         t1=(i-)-,t2=k-(i+);

         if (t1>&&sg[t1]==-) calc(t1);

         if (t2>&&sg[t2]==-) calc(t2);

     }

     memset(bo,,sizeof(bo));

     for (int i=,t,t1,t2;i<=k;i++){

         t1=(i-)-,t2=k-(i+),t=;

         if (t1>) t^=sg[t1];

         if (t2>) t^=sg[t2];

         bo[t]=;

     }

     for (int i=;;i++) if (!bo[i]){sg[k]=i;break;}

 }

 int main(){

     scanf("%s",s+);

     n=strlen(s+);

     for (int i=;i<n;i++) if (s[i-]==s[i+]) can[i]=;

     for (int i=;i<n;i++){

         if (can[i]&&!l) l=i;

         if (!can[i]&&l) list[++idx]=(DATA){l,i-,i--l+},l=;

     }

     if (l) list[++idx]=(DATA){l,n-,n--l+};

     memset(sg,-,sizeof(sg));

     for (int i=;i<=idx;i++){

         if (sg[list[i].siz]==-) calc(list[i].siz);

         tmp^=sg[list[i].siz];

     }

     if (tmp){

         puts("First");

         for (int i=,t;i<=idx;i++){

             t=sg[list[i].siz];

             for (int j=list[i].l,t1,t2,t3;j<=list[i].r;j++){

                 t1=(j-)-list[i].l,t2=list[i].r-(j+),t3=;

                 if (t1>) t3^=sg[t1];

                 if (t2>) t3^=sg[t2];

                 if (!(tmp^t^t3)){printf("%d\n",j),flag=;break;}

             }

             if (flag) break;

         }

     }

     else puts("Second");

     return ;

 }