Write a program to output the nth fibonacci number in quinary Quinary is like binary, except that 1 is represented by the text of the program, and 0 is represented as the backwards text of the program.

The Fibonacci Sequence is the well known sequence

F(0) = 0, F(1) = 1, F(n) = F(n - 1) + F(n - 2)

Write a program that takes some input n and outputs the nth fibonacci number in quinary.

Standard code golf rules apply.
Python, 226 bytes
s='s=%r;a,b=0,1;exec&quot;a,b=b,a+b;&quot;*input();print&quot;&quot;.join(map(lambda i:(s%%s)*int(i)+(s%%s)[::-1]*(1-int(i)),bin(a)[2:]))';a,b=0,1;exec&quot;a,b=b,a+b;&quot;*input();print&quot;&quot;.join(map(lambda i:(s%s)*int(i)+(s%s)[::-1]*(1-int(i)),bin(a)[2:]))

It's quite a heavy modification to the standard Python Quine. It uses a,b=0,1;exec&quot;a,b=b,a+b;&quot; to generate Fibonacci numbers.