#include<bits/stdc++.h>

 using namespace std;

 long long  fs[];

 void init() {

     fs[] = ;

     fs[] = ;

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

         fs[i] = fs[i-] + fs[i-];

     }

 }

 bool find(long long n) {

     int l = ;

     int r = ;

     int mid = (l+r) >> ;  //   (l+r)/2

     while(l <= r) {

         if(fs[mid] == n) return true;

         else if(fs[mid] < n) l = mid + ;

         else  r = mid - ;

         mid = (l+r) >> ;

     }

     return false;

 }

 int main() {

     init();

     long long n;

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

         if(find(n))  puts("Second win");

         else    puts("First win");

     }

     return ;

 }