Given that 
```
f0 = '0'
f1 = '01'
f2 = '010' = f1 + f0
f3 = '01001' = f2 + f1
```
You will be given a number and your task is to return the `nth` fibonacci string. For example:
```
solve(2) = '010'
solve(3) = '01001'
```
More examples in test cases. Good luck!
If you like sequence Katas, you will enjoy this Kata: [Simple Prime Streaming](https://www.codewars.com/kata/5a908da30025e995880000e3)
def solve(n):
    print(n)
    a = '0'
    b = '01'
    lf = 1
    if n > 1:
        for i in range(n-lf):
            c = b+a
            a = b
            b = c
        return c
    elif n == 1:
        return b
    else:
        return a
def solve(n):
    print(n)
    a = '0'
    b = '01'
    lf = 1
    if n > 1:
        for i in range(n-lf):
            c = b+a
            a = b
            b = c
        return c
    elif n == 1:
        return b
    else:
        return a