The Little Girl loves problems on games very much. Here's one of them.

Two players have got a string *s*, consisting of lowercase English letters. They play a game that is described by the following rules:
 -  The players move in turns; In one move the player can remove an arbitrary letter from string *s*. -  If the player before his turn can reorder the letters in string *s* so as to get a palindrome, this player wins. A palindrome is a string that reads the same both ways (from left to right, and vice versa). For example, string "abba" is a palindrome and string "abc" isn't. 
Determine which player will win, provided that both sides play optimally well — the one who moves first or the one who moves second.
The input contains a single line, containing string *s* (1 ≤ |*s*|  ≤  10<sup class="upper-index">3</sup>). String *s* consists of lowercase English letters.
import sys
import os
from collections import Counter, defaultdict, deque
from heapq import heapify, heappush, heappop
from functools import lru_cache
from math import floor, ceil, sqrt, gcd
from string import ascii_lowercase
from math import gcd
from bisect import bisect_left, bisect, bisect_right


def __perform_setup__():
    INPUT_FILE_PATH = "/Users/osama/Desktop/Competitive Programming/input.txt"
    OUTPUT_FILE_PATH = "/Users/osama/Desktop/Competitive Programming/output.txt"

    sys.stdin = open(INPUT_FILE_PATH, 'r')
    sys.stdout = open(OUTPUT_FILE_PATH, 'w')


if "MY_COMPETITIVE_PROGRAMMING_VARIABLE" in os.environ:
    __perform_setup__()


def read():
    return input().strip()


def read_int():
    return int(read())


def read_str_list():
    return read().split()


def read_numeric_list():
    return list(map(int, read_str_list()))


def solve(s):
    counts = Counter(s)

    def is_palindrome(counts):
        odd_counts = sum(v & 1 for v in counts.values())
        return odd_counts <= 1

    def pick(counts):
        for ch in ascii_lowercase:
            if counts[ch] & 1:
                return ch

        for ch in ascii_lowercase:
            if counts[ch]:
                return ch

        return None

    turn = 0
    players = ["FIRST", "SECOND"]

    while not is_palindrome(counts):
        ch = pick(counts)
        counts[ch] -= 1

        turn = 1-turn

    return players[turn]


s = read()
print(solve(s))
