Benji has a $2 \times 2$ grid, which he proceeds to place chips on. One by one, he places a chip on one of the unit squares of the grid at random. However, if at any point there is more than one chip on the same square, Benji moves two chips on that square to the two adjacent squares, which he calls a chip-fire. He keeps adding chips until there is an infinite loop of chip-fires. What is the expected number of chips that will be added to the board?

Let's think step by step and output the final answer within \boxed{}.
user