There is a $2n\times 2n$ rectangular grid and a chair in each cell of the grid. Now, there are $2n^2$ pairs of couple are going to take seats. Define the distance of a pair of couple to be the sum of column difference and row difference between them. For example, if a pair of couple seating at $(3,3)$ and $(2,5)$ respectively, then the distance between them is $|3-2|+|3-5|=3$. Moreover, define the total distance to be the sum of the distance in each pair. Find the maximal total distance among all possibilities.
1. **Define the problem and coordinates:**
   We have a $2n \times 2n$ grid with $2n^2$ pairs of couples. Each couple's distance is defined as the sum of the absolute differences in their row and column coordinates. We aim to find the maximal total distance among all possible seating arrangements.

2. **Contribution of $x$-coordinates:**
   Let the $x$-coordinates of the couples be $\{a_1, b_1\}, \{a_2, b_2\}, \ldots, \{a_{2n^2}, b_{2n^2}\}$. The contribution of the $x$-coordinates to the overall sum of distances is:
   \[
   \sum_{i=1}^{2n^2} |a_i - b_i| = \sum_{i=1}^{2n^2} (a_i + b_i) - 2 \sum_{i=1}^{2n^2} \min\{a_i, b_i\}
   \]

3. **Sum of $a_i + b_i$:**
   The first sum, $\sum_{i=1}^{2n^2} (a_i + b_i)$, is the sum of all $x$-coordinates taken twice:
   \[
   \sum_{i=1}^{2n^2} (a_i + b_i) = 2 \sum_{i=1}^{2n^2} a_i = 2 \left(1 + 2 + \cdots + 2n\right) \cdot 2n = 2 \cdot \frac{2n(2n+1)}{2} \cdot 2n = 4n^3 + 2n^2
   \]

4. **Minimum sum of $\min\{a_i, b_i\}$:**
   Since at most $2n$ terms of the form $\min\{a_i, b_i\}$ can be equal, the minimum of $\sum_{i=1}^{2n^2} \min\{a_i, b_i\}$ is:
   \[
   \sum_{i=1}^{2n^2} \min\{a_i, b_i\} = 2n \cdot (1 + 2 + \cdots + n) = 2n \cdot \frac{n(n+1)}{2} = n^3 + n^2
   \]

5. **Contribution of $x$-coordinates to the total distance:**
   Therefore, the contribution of the $x$-coordinates to the total distance is:
   \[
   4n^3 + 2n^2 - 2(n^3 + n^2) = 2n^3
   \]

6. **Contribution of $y$-coordinates:**
   By symmetry, the contribution of the $y$-coordinates to the total distance is also $2n^3$.

7. **Total distance:**
   Thus, the total sum of distances is:
   \[
   2n^3 + 2n^3 = 4n^3
   \]

8. **Achieving the maximal distance:**
   To achieve this maximal distance, we can arrange the couples as follows:
   - Fill the top half of the grid with one member of each couple in each cell.
   - For $(i, j)$ in the top-left quadrant, place its partner at $(i+1, j+n)$.
   - For $(i, j)$ in the top-right quadrant, place its partner at $(i-n, j+n)$.
   
   In this arrangement, the distance for each couple is $n + n = 2n$, so the total distance is:
   \[
   n \cdot 2n^2 = 4n^3
   \]

The final answer is $\boxed{4n^3}$.