Acquaintance#6635
Young doctor John Watson returns to England after being demobilized. Here, he reconnects with an old acquaintance, Mr. Stamford, who suggests that Watson rent a room at 221-b Baker Street from an elderly lady named Mrs. Hudson. Sharing the apartment is Mr. Sherlock Holmes, who occupies another room in the house.
Watson soon discovers that Sherlock Holmes is quite an unusual character. On one hand, Holmes is an accomplished violinist, conducts chemical experiments, possesses extensive knowledge of London's soil, and is intimately familiar with the Criminal Code of England. On the other hand, he doesn't read fiction and is unaware that the Earth revolves around the Sun. Additionally, many peculiar individuals frequently visit Holmes, leading Watson to suspect that Holmes might be a criminal. Curious, Watson decides to visit Holmes.
Upon entering Holmes's room, Watson finds him engrossed in a chemical experiment. Holmes remains silent in response to Watson's questions. Just as Watson is about to leave, feeling his visit was in vain, Holmes begins discussing a peculiar game called Nim. The rules are straightforward: two players take turns. There are several piles of stones, and on each turn, a player can remove any non-zero number of stones from one pile. The player unable to make a move loses. Holmes then starts posing questions to Watson. Each question is: "Who will win this game if in version a pile of stones is added or the last added one is removed?" Holmes refers to a pre-formed sequence of piles as a version, assigning a new number to the sequence with each question.
Eager to learn more about Holmes, Watson decides to answer the questions. However, faced with numerous questions, Dr. Watson seeks your assistance.
The first line contains the number of actions (1 \le N \le 500000). Each subsequent line, numbered i+1, describes an action:
+ X M — add a pile of size to sequence (0 \le X < i);
- X — remove the last added pile from sequence (0 \le X < i),
All request numbers start from one.
Initially, the sequence is empty, and this initial version is numbered . Then there are lines, each containing a description of the next request. The format of the requests is described above. When processing the -th request, the new version will receive the number . There will be no requests for non-existent versions or requests to remove elements from an empty sequence.
For each request, output on a separate line First if the player who moves first wins in the formed sequence, or Second otherwise.
Example 1