#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } int main(){ ll n=1000; vl dp(n+1);dp[0]=0; for(ll i=1;i<=n;i++){ set st; for(ll j=0;j> m; ll ret=0; ll prev=-1; ll ans=0; rep(i,m+1){ ll x; if(i> x; else x=INF; if(x-prev==1){ ret++; } else{ if(ret<1000)ans^=dp[ret]; else { ll to=(ret-1000)/34; to=ret-(to+1)*34; ans^=dp[to]; } ret=1; } prev=x; } if(ans!=0)cout << "First" << endl; else cout << "Second" << endl; }