#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const LL one = ;

const LL maxn = one<<;

set<LL> st;

void init(){

    LL f1 = ,f2 = ;

    st.insert(f1);

    for(LL i = f1 + f2;i < maxn;i = f1 + f2){

        st.insert(i);

        LL temp = i;

        f2 = f1,f1 = temp;

    }

}

int main(){

    LL n;

    init();

    while(scanf("%lld",&n) ==  && n){

        printf("%s\n",st.count(n) ? "Second win" : "First win");

    }

    return ;

}