Problem:
Score : 500 points

Problem Statement

There is a string s of length 3 or greater.
No two neighboring characters in s are equal.

Takahashi and Aoki will play a game against each other.
The two players alternately performs the following operation, Takahashi going first:

Remove one of the characters in s, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in s.

The player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.

Constraints

3 ≤ |s| ≤ 10^5

s consists of lowercase English letters.

No two neighboring characters in s are equal.

Input

The input is given from Standard Input in the following format:

s

Output

If Takahashi will win, print First. If Aoki will win, print Second.

Sample Input 1

aba

Sample Output 1

Second

Takahashi, who goes first, cannot perform the operation, since removal of the b, which is the only character not at either ends of s, would result in s becoming aa, with two as neighboring.

Sample Input 2

abc

Sample Output 2

First

When Takahashi removes b from s, it becomes ac.
Then, Aoki cannot perform the operation, since there is no character in s, excluding both ends.

Sample Input 3

abcab

Sample Output 3

First

Solution in Ruby (2.3.3) (judge verdict: Accepted)

# 「先手と後手が最善を尽くす」とあるけど、実は最善も最悪も存在しない
# 先手と後手がどのような手を出しても、勝者は変わらない……と、予想
# 以上より、両者とも「取れる最初の文字を取り去る」

str = gets.chomp

c = 0
fl = 0
while true do
	
	0.upto(str.length - 3) do |i|
		if str[i] != str[i+2]
			str.slice!(i+1)
			c += 1
#			puts str
			break
		end
		
		if i == str.length - 3
			# 文字を削除できない
			fl = 1
			break
		end
	end
	
	break if fl == 1
	break if str.length == 2
end

if c % 2 == 0
	puts "Second"
else
	puts "First"
end