AT_code_festival_china_b n-th Points

[problemUrl]: https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_b

Input is given in the following format > $ Q $ $ n_1 $ $ n_2 $ : $ n_Q $ - On the first line, you will be given an integer $ Q\ (1\ \leq\ Q\ \leq\ 100,000) $, the number of queries. - On the following $ Q $ lines, each line contains the information of each query. The $ i $-th $ (1\ \leq\ i\ \leq\ Q) $ line consists of $ n_i\ (1\ \leq\ n_i\ \leq\ 10^{18}) $, the number $ n $ of the $ i $-th query.

Output $ Q $ lines, each line containing the answer to each query in the order the queries appear in the input. Make sure to insert a line break at the end of the last line.

### Problem Let us define an strict total order relation between $ 2 $ distinct points $ P(x_1,y_1) $,$ Q(x_2,y_2) $ on a rectangular coordinate plane as following. - If $ |x_1|+|y_1|\neq|x_2|+|y_2| $ and $ |x_1|+|y_1|\