C. Arrow Path

There is a grid, consisting of 2 rows and 𝑛 columns. The rows are numbered from 1

1 to 2 from top to bottom. The columns are numbered from 1 to 𝑛 from left to right. Each cell of the grid contains an arrow pointing either to the left or to the right. No arrow points outside the grid.

There is a robot that starts in a cell (1,1). Every second, the following two actions happen one after another:

1. Firstly, the robot moves left, right, down or up (it can't try to go outside the grid, and can't skip a move);
2. then it moves along the arrow that is placed in the current cell (the cell it ends up after its move).

Your task is to determine whether the robot can reach the cell (2,𝑛).