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.
t=1
while(t>0):
    t-=1
    cad=input()
    cntImpar=0
    v=[0]*27
    for i in range(0,len(cad)):
        val=ord(cad[i])-97
        v[val]+=1
    for i in range(0,26):
        if(v[i]>0 and v[i]%2==1):
            cntImpar+=1
    if(cntImpar<=1):
        print("Primero")
    else:
        S=0
        for i in range(0,26):
            if(v[i]>0):
                S+=v[i]
        if(S%2==0):
            print("Segundo")
        else:
            print("Primero")