276B.md (1338B)
1 Source: https://codeforces.com/problemset/problem/276/B 2 3 B. Little Girl and Game 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 The Little Girl loves problems on games very much. Here's one of them. 22 23 Two players have got a string *s*, consisting of lowercase English letters. They play a game that is described by the following rules: 24 25 * The players move in turns; In one move the player can remove an arbitrary letter from string *s*. 26 * 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. 27 28 Determine which player will win, provided that both sides play optimally well — the one who moves first or the one who moves second. 29 30 Input 31 32 The input contains a single line, containing string *s* (1 ≤ |*s*| ≤ 103). String *s* consists of lowercase English letters. 33 34 Output 35 36 In a single line print word "First" if the first player wins (provided that both players play optimally well). Otherwise, print word "Second". Print the words without the quotes. 37 38 Examples 39 40 Input 41 42 ``` 43 aba 44 ``` 45 46 Output 47 48 ``` 49 First 50 ``` 51 52 Input 53 54 ``` 55 abca 56 ``` 57 58 Output 59 60 ``` 61 Second 62 ```