Implement a FIFO Queue using only two Python lists used as stacks (append/pop from the end). Provide enqueue(x), dequeue() (raises IndexError if empty), peek() and __len__. Each operation must be amortised O(1): only move items from the inbox to the outbox when the outbox is empty.