This problem is a run-twice (communication) problem. Alice has an integer (x) where (1 \le x \le 2^{15}), which she needs to send to Bob (an astronaut on the Moon) as it is an important parameter for their secret project on the Moon. Fortunately, Alice has a secret storage device (S), which contains a not necessarily non-empty subset of the set (\{1, 2, \ldots, 20\}). She plans to send (S) to Bob. Bob's goal is to recover the value of (x) using only (S). However, after Alice sends set (S) on a spaceship and before Bob receives (S), magical butterflies had intercepted the spaceship! When Bob finally receives (S), one of the following had occurred: An arbitrary element is removed from (S). This can only be done if (S) is non-empty. An arbitrary element is added to (S). This should still satisfy (S \subseteq \{1, 2, \ldots, 20\}). (S) remained unchanged. Please devise a strategy for Alice and Bob so that Bob can determine the value of (x) regardless of what happened to set (S). Precisely, in this problem your code will be run exactly two times on each test. On the first run, you will act as Alice, and on the second Bob. No additional information other than the set (S) can be transferred from Alice to Bob. To get an Accepted verdict, your code on the second run should be able to exactly recover the integers that were received on the first run. First Run Input The first line of the input contains the string first . The purpose of this is so your program recognizes that this is its first run, and it should act as Alice. The second line of the input contains exactly one integer (t) ((1 \le t \le 10^4)) — the number of test cases. The first and only line of the (i)-th test case contains an integer (x) ((1 \le x \le 2^{15})). Output For each test case, send (S) to Bob by printing two lines in the following manner. On the first line, output an integer (n) ($$$0 \le n