ESYRCRTN  Why Always Recursion
 F(1) = 1
 F(2) = 3
 F(N) = F(N1)  F(N2)
Input
Input starts with an integer T (1 <= T <= 1000), denoting the number of test cases. Each test case contains an integer N (1 <= N <= 10^18).
Output
For each test case, print the value.
Example
Input: 2 1 2 Output: 1 4
hide comments
monil_ladha:
20171015 14:34:24
easy!! Just try to figure out the pattern.. 

sgc_072:
20170904 13:31:42
The question's name is tricky :P 

arikpamnani:
20170728 22:06:01
3 lines in Python :p 

hunnychauhan:
20170719 13:49:59
easy with pen paper.... 

losmi247:
20170609 17:41:35
Guys, heres a tip:


amulyagaur:
20170519 07:08:12
@akayushi.... modulo 6 trick may be of some help Last edit: 20170519 07:08:42 

akayushi:
20170514 12:49:51
i am getting wrong answer..someone give me some hint


holmesherlock:
20170401 00:41:11
printf ,scanf gave WA,, 

vengatesh15:
20170212 18:37:03
easy one with pen and paper 

kass_97:
20170106 12:23:52
Just requires pen and paper to solve :p 
Added by:  Murad 
Date:  20160402 
Time limit:  0.5s1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 
Resource:  None 