def fn(x, y):
    if x[0] > y[0]:
        return x
    else:
        return y

class SegmentTree:
    # 初期化処理
    # f : SegmentTreeにのせるモノイド
    # default : fに対する単位元
    def __init__(self, size, f=fn, default=(0, 0)):
        self.size = 2**(size-1).bit_length()
        self.default = default
        self.dat = [default]*(self.size*2)
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1
            l >>= 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            r >>= 1
        res = self.f(lres, rres)
        return res

n = int(input())
a = list(map(int, input().split()))
seg = SegmentTree(n)
for i in range(n):
    seg.update(i, (a[i], i))
b = a[:]
s = sum(a)
k = 1
while s > 0:
    if s % 2 == 1:
        print('First')
        break
    for i in range(n):
        b[i] //= 2
    k *= 2
    s = sum(b)
else:
    print('Second')
    i, x = map(int, input().split())
    if int(input()):
        exit(0)
    i -= 1
    seg.update(i, (seg.query(i, i + 1)[0] - x, i))
    k = x & -x

while 1:
    x, i = seg.query(0, n)
    seg.update(i, (x - k, i))
    print(i + 1, k)
    if int(input()):
        exit(0)
    i, x = map(int, input().split())
    if int(input()):
        exit(0)
    i -= 1
    seg.update(i, (seg.query(i, i + 1)[0] - x, i))
    k = x & -x