An Ordinary Game

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.

Examples

Input

aba

Output

Second

Input

abc

Output

First

Input

abcab

Output

First

inputFormat

Input

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

s

outputFormat

Output

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

Examples

Input

aba

Output

Second

Input

abc

Output

First

Input

abcab

Output

First

样例

abc

First