Is Fibonacci that easy

The Fibonacci sequence F0,F1,… is a special infinite sequence of non-negative integers, where F0=0, F1=1 and for each integer n≥2, Fn=Fn−1+Fn−2. Consider the sequence D of the last decimal digits of the first N Fibonacci numbers, i.e. D=(F0%10,F1%10,…,FN−1%10). Now, you should perform the following process: Let D=(D1,D2,…,Dl). If l=1, the process ends. Create a new sequence E=(D2,D4,…,D2⌊l