from heapq import heappop,heappush
N=int(input())
A=list(map(int,input().split()))
X=0
pq=[]
for i in A:
  X^=i
K=10**9
for i in range(N):
  heappush(pq,(-A[i],i))
if X==0:
  print("Second")
else:
  K=X&-X
  print("First")
  v,i = heappop(pq)
  print(i+1,K)
  A[i]-=K
  heappush(pq,(-A[i],i))
  ret=int(input())
  if ret!=0:
    exit(0)

while 1:
  i,x=map(int,input().split())
  i-=1
  A[i]-=x
  heappush(pq,(-A[i],i))
  ret=int(input())
  if ret!=0:
    exit(0)
  K=x&-x
  while 1:
    v,i=heappop(pq)
    if -A[i]==v:
      break
  print(i+1,K)
  A[i]-=K
  heappush(pq,(-A[i],i))
  ret=int(input())
  if ret!=0:
    exit(0)