A game involving pots and marbles

There are three empty pots on a table. Batman, Robin, and The Joker put marbles in the pots one by one. They play successively, with the order chosen by The Joker in the beginning (if the Joker chooses Robin, The Joker, then Batman, then they will place marbles in the order R,J,B,R,J,B...). On each turn, Batman plays in the first or second jar, Robin in the second or third jar, and The Joker in the second or third jar. The second and third jars have maximum capacities of 2018 marbles, and the first jar has a maximum capacity of $n$ marbles. The first player who cannot play a marble loses.

Find the minimum value of $n$ such that Batman and Robin can cooperate to make The Joker lose.