Just like in the ["father" kata](http://www.codewars.com/kata/find-fibonacci-last-digit/), you will have to return the last digit of the nth element in the Fibonacci sequence (starting with 1,1, to be extra clear, not with 0,1 or other numbers).

You will just get much bigger numbers, so good luck bruteforcing your way through it ;)
```python
last_fib_digit(1) == 1
last_fib_digit(2) == 1
last_fib_digit(3) == 2
last_fib_digit(1000) == 5
last_fib_digit(1000000) == 5
```
``` haskell
lastFibDigit       1 == 1
lastFibDigit       2 == 1
lastFibDigit       3 == 2
lastFibDigit    1000 == 5
lastFibDigit 1000000 == 5
```

Difficulty: EASY
Starter code: def last_fib_digit(n):
	

Solutions:
def last_fib_digit(n):
	return [0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7, 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9, 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3, 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1][n % 60]


def last_fib_digit(n):
	a = 0
	b = 1
	for _ in range(n % 60):
		(a, b) = (b, (a + b) % 10)
	return a


last_fib_digit = lambda n: int((5 ** 0.5 / 2 + 0.5) ** (n % 60) / 5 ** 0.5 + 0.5) % 10


def find_pattern():
	fib = [1, 1, 2]
	while fib[-2:] != [1, 1]:
		fib.append((fib[-2] + fib[-1]) % 10)
	return fib[:-2]
pattern = find_pattern()

def last_fib_digit(n):
	return pattern[(n - 1) % len(pattern)]


def last_fib_digit(n):
	s = [0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7, 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9, 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3, 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]
	return s[n % len(s)]


def last_fib_digit(index):
	(last, tmp, index) = (0, 1, index % 60)
	for i in range(index):
		(last, tmp) = (tmp, (last + tmp) % 10)
	return last


def last_fib_digit(n):
	n = (n - 1) % 60
	(a, b) = (1, 1)
	for i in range(n):
		(a, b) = (b, (a + b) % 10)
	return a