Implement the Fibonacci sequence... Shifted to the right Background
We all know the famous Fibonacci sequence, where each term is the sum of the previous two, with the first term being 0 and the second one being 1. The first few elements are:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765

What we are going to implement today is a similar sequence, starting at 0 and 1 as well, and each term is the sum of the previous two, but the sum's digits are shifted by one place to the right. What does &quot;shifted&quot; mean? – A digit shifted to the right is basically that digit + 1, unless it equals 9, which maps to 0 instead. Just as a reference, here is the full list of mappings:
0 -&gt; 1;  1 -&gt; 2;  2 -&gt; 3;  3 -&gt; 4;  4 -&gt; 5;  5 -&gt; 6;  6 -&gt; 7;  7 -&gt; 8;  8 -&gt; 9;  9 -&gt; 0


With all that being said, these are the first terms of our Fibonacci-shifted sequence:
0, 1, 2, 4, 7, 22, 30, 63, 4, 78, 93, 282, 486, 879, 2476, 4466, 7053, 22620, 30784, 64515

Given an integer N (non-negative if 0-indexed and positive if 1-indexed), finds the Nth term of the Fibonacci-shifted sequence.
Rules

The output may contain leading zero(es), in case 9 is the first (few) digit(s).

Input and output can be handled using any default mean.

Take note that Loopholes are forbidden.

This is code-golf, hence your program will be scored in bytes, with less bytes being better.
Python 2, 78 72 bytes



f=lambda n:n&gt;1and int(''.join(`-~int(i)%10`for i in`f(n-1)+f(n-2)`))or n


Try it online!

Saved 6 bytes thanks to Halvard Hummel.