Three $n\times n$ squares form the figure $\Phi$ on the checkered plane as shown on the picture. (Neighboring squares are tpuching along the segment of length $n-1$.)
Find all $n > 1$ for which the figure $\Phi$ can be covered with tiles $1\times 3$ and  $3\times 1$ without overlapping.[img]https://pp.userapi.com/c850332/v850332712/115884/DKxvALE-sAc.jpg[/img]
We need to determine for which values of \( n > 1 \) the figure \(\Phi\) can be covered with \(1 \times 3\) and \(3 \times 1\) tiles without overlapping. The figure \(\Phi\) consists of three \(n \times n\) squares arranged such that neighboring squares touch along a segment of length \(n-1\).

1. **Case \(3 \mid n\):**
   - If \(n\) is a multiple of 3, then each \(n \times n\) square can be completely tiled with \(1 \times 3\) and \(3 \times 1\) tiles. Since the figure \(\Phi\) is composed of three such squares, the entire figure can be tiled without any gaps or overlaps. Therefore, if \(3 \mid n\), the figure \(\Phi\) can be covered with the given tiles.

2. **Case \(3 \nmid n\):**
   - We will use a coloring argument to show that if \(n\) is not a multiple of 3, the figure \(\Phi\) cannot be covered with \(1 \times 3\) and \(3 \times 1\) tiles.

3. **Coordinate System and Coloring:**
   - Define a coordinate system where the top-left corner of the figure is \((0, 0)\). Each time we move right, the \(x\)-coordinate increases by 1, and each time we move down, the \(y\)-coordinate increases by 1.
   - Color each square \((x, y)\) with the color \((x + y) \mod 3\). This results in a periodic coloring pattern with three colors (0, 1, 2).

4. **Tiling Constraints:**
   - Each \(1 \times 3\) or \(3 \times 1\) tile will cover exactly one square of each color (0, 1, 2) because the sum of the coordinates of the squares covered by the tile will span all residues modulo 3.

5. **Counting Colors:**
   - For the figure \(\Phi\), we need to count the number of squares of each color. Since the figure consists of three \(n \times n\) squares, the total number of squares is \(3n^2\).
   - If \(n\) is not a multiple of 3, the number of squares of each color will not be equal. Specifically, the number of squares of each color will not be congruent modulo 3.

6. **Contradiction:**
   - Since each \(1 \times 3\) or \(3 \times 1\) tile must cover one square of each color, the total number of squares of each color must be equal for the tiling to be possible. However, if \(n\) is not a multiple of 3, this condition is not met, leading to a contradiction.

Therefore, the figure \(\Phi\) can only be covered with \(1 \times 3\) and \(3 \times 1\) tiles if \(n\) is a multiple of 3.

The final answer is \( \boxed{ n } \) must be a multiple of 3.