ZOJ 1633 big string

Big String

---

Time Limit: 2 Seconds         Memory Limit: 65536 KB

---

We will construct an infinitely long string from two short strings: A = "^__^" (four characters), and B = "T.T" (three characters). Repeat the following steps:

• Concatenate A after B to obtain a new string C. For example, if A = "^__^" and B = "T.T", then C = BA = "T.T^__^".
• Let A = B, B = C -- as the example above A = "T.T", B = "T.T^__^".

Your task is to find out the n-th character of this infinite string.

Input

The input contains multiple test cases, each contains only one integer N (1 <= N <= 2^63 - 1). Proceed to the end of file.

Output

For each test case, print one character on each line, which is the N-th (index begins with 1) character of this infinite string.

Sample Input

1
2
4
8

Sample Output

T
.
^
T

---

Author: CHENG, Long
Source: Zhejiang University Local Contest 2003
源码：


解题报告：
  首先需要看清题目给出的数据范围，这并不是一题高精度题目，只需long long型就可以存储
  long long 型是int 的两倍，int 32 位，long long为64位 支持的最大数为 2^63-1。
  此题相当于一题斐波那契数列题，f(0)=3,f(1)=4, f(n)=f(n-1)+f(n-2);   需要注意初值的顺序不能反掉