Write a function that takes two lists (lst1 and lst2) and an int n, and returns True if the second list equals the first list shifted by n positions. Otherwise, return False.
circular_shift([1, 2, 3, 4], [3, 4, 1, 2], 2) ➞ True
circular_shift([1, 1], [1, 1], 6) ➞ True
circular_shift([0, 1, 2, 3, 4, 5], [3, 4, 5, 2, 1, 0], 3) ➞ False
n can be a negative value.