from collections import defaultdict,deque

import sys,heapq,bisect,math,itertools,string,queue,datetime

sys.setrecursionlimit(10**8)

INF = float('inf')

mod = 10**9+7

eps = 10**-7

def inpl(): return list(map(int, input().split()))

def inpl_s(): return list(input().split())



S = list(eval(input()))

L = len(S)

if L%2 == 1:

	if S[0] == S[-1]:

		print('Second')

	else:

		print('First')

else:

	if S[0] != S[-1]:

		print('Second')

	else:

		print('First')

S = eval(input())

L = len(S)



if S[0]==S[-1]:

    if L%2==0:

        print("First")

    else:

        print("Second")

else:

    if L%2==1:

        print("First")

    else:

        print("Second")
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, datetime

sys.setrecursionlimit(10**8)
INF = float("inf")
mod = 10**9 + 7
eps = 10**-7


def inpl():
    return list(map(int, input().split()))


def inpl_s():
    return list(input().split())


S = list(eval(input()))
L = len(S)
if L % 2 == 1:
    if S[0] == S[-1]:
        print("Second")
    else:
        print("First")
else:
    if S[0] != S[-1]:
        print("Second")
    else:
        print("First")

S = eval(input())
L = len(S)
if S[0] == S[-1]:
    if L % 2 == 0:
        print("First")
    else:
        print("Second")
else:
    if L % 2 == 1:
        print("First")
    else:
        print("Second")

-from collections import defaultdict, deque -import sys, heapq, bisect, math, itertools, string, queue, datetime - -sys.setrecursionlimit(10**8) -INF = float("inf") -mod = 10**9 + 7 -eps = 10**-7 - - -def inpl(): -    return list(map(int, input().split())) - - -def inpl_s(): -    return list(input().split()) - - -S = list(eval(input())) +S = eval(input()) -if L % 2 == 1: -    if S[0] == S[-1]: +if S[0] == S[-1]: +    if L % 2 == 0: +        print("First") +    else: +else: +    if L % 2 == 1: +        print("First") -        print("First") -else: -    if S[0] != S[-1]: -    else: -        print("First")