#include <bits/stdc++.h>
using namespace std;

#define int long long

const int maxn = 1e5 + 10;
int n, a[maxn];
int c0, c1, cnt, GCD;

bool solve() {
	c1 = 0, c0 = 0, cnt = 0, GCD = 0;
	for (int i = 0; i < n; i++) {
		if (a[i] == 1) {
			c1++;
			cnt++;
			continue;
		}
		if (a[i] % 2) {
			c1++;
			a[i]--;
		}
		else
			c0++;
		GCD = __gcd(GCD, a[i]);
	}
	if (c0 % 2) 		 return 1;
	if (cnt || c1 > 1) return 0;
	for (int i = 0; i < n; i++) a[i] /= GCD;
	return !solve();
}
int32_t main() {
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	if (solve())
		cout << "First";
	else
		cout << "Second";
	return 0;
}
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

int main(){
  ll N;
  IN(N);

  ll start = 0;
  ll end = N-1;
  ll start_sex = 0;
  string str;
  std::cout << 0 << std::endl;
  IN(str);
  if(str=="Male") start_sex = 0;
  else if(str=="Female") start_sex = 1;
  else return 0;

  while(end-start>1){
    ll mid = (start+end)/2;
    std::cout << mid << std::endl;
    IN(str);
    ll sex = 0;
    if(str=="Male") sex = 0;
    else if(str=="Female") sex = 1;
    else return 0;
    if((mid-start)&1){
      if(start_sex!=sex){
        start = mid;
        start_sex = sex;
      }else{
        end = mid;
      }
    }else{
      if(start_sex!=sex){
        end = mid;
      }else{
        start = mid;
        start_sex = sex;
      }
    }
  }

  std::cout << start << std::endl;
  IN(str);
  if(str=="Vacant") return 0;

  std::cout << end << std::endl;
  IN(str);

  return 0;
}