Alternating Fibonacci In the alternating Fibonacci sequence, you first start with 1 and 1 as usual.

However, instead of always adding the last two values to get the next number, you alternate starting with adding, and every other time you subtract instead.

The sequence starts like this:

1
1
2    # 1 + 1
-1   # 1 - 2
1    # 2 + -1
-2   # -1 - 1
-1   # 1 + -2
-1   # -2 - -1
-2   # -1 + -1
1    # -1 - -2
-1   # -2 + 1
2    # 1 - -1
1    # -1 + 2
1    # 2 - 1


etc.

Notice that after it starts over once it gets to 1 and 1 again.

Given a number N, print the Nth term of the alternating fibonacci sequence.

Remember, this is code-golf, so the code with the smallest number of bytes wins.
JavaScript (ES6), 25 bytes

n=&gt;"334130110314"[n%12]-2


0-indexed. You can shorten the string with a slightly recursive version, though it adds 6 bytes:

f=n=&gt;"3341301"[n]-2||f(13-n%12)


This is still shorter than the definitive recursive formula:

f=n=&gt;n&lt;2||f(n-2)+f(n-1)*(-n%2|1)