Tsrutsuna starts in the bottom left cell of a 7 × 7 square table, while Tsuna is in the upper right cell. The center cell of the table contains cheese. Tsrutsuna wants to reach Tsuna and bring a piece of cheese with him. From a cell Tsrutsuna can only move to the right or the top neighboring cell. Determine the number of different paths Tsrutsuna can take from the lower left cell to the upper right cell, such that he passes through the center cell.

[i]Proposed by Giorgi Arabidze, Georgia[/i]
1. **Determine the coordinates of the relevant cells:**
   - The bottom left cell (starting point) is at \((0,0)\).
   - The upper right cell (ending point) is at \((6,6)\).
   - The center cell (cheese) is at \((3,3)\).

2. **Calculate the number of ways to reach the center cell \((3,3)\) from the starting point \((0,0)\):**
   - To move from \((0,0)\) to \((3,3)\), Tsrutsuna needs to make exactly 3 right moves and 3 up moves.
   - The total number of moves is \(3 + 3 = 6\).
   - The number of ways to arrange these moves is given by the binomial coefficient:
     \[
     \binom{6}{3} = \frac{6!}{3!3!} = 20
     \]

3. **Calculate the number of ways to reach the ending point \((6,6)\) from the center cell \((3,3)\):**
   - To move from \((3,3)\) to \((6,6)\), Tsrutsuna again needs to make exactly 3 right moves and 3 up moves.
   - The total number of moves is \(3 + 3 = 6\).
   - The number of ways to arrange these moves is given by the same binomial coefficient:
     \[
     \binom{6}{3} = \frac{6!}{3!3!} = 20
     \]

4. **Calculate the total number of paths from \((0,0)\) to \((6,6)\) passing through \((3,3)\):**
   - Since the paths from \((0,0)\) to \((3,3)\) and from \((3,3)\) to \((6,6)\) are independent, the total number of such paths is the product of the two individual path counts:
     \[
     20 \times 20 = 400
     \]

\(\blacksquare\)

The final answer is \( \boxed{ 400 } \)