Fix an integer $n \geq 2$. An $n\times n$ sieve is an $n\times n$ array with $n$ cells removed so that exactly one cell is removed from every row and every column. A stick is a $1\times k$ or $k\times 1$ array for any positive integer $k$. For any sieve $A$, let $m(A)$ be the minimal number of sticks required to partition $A$. Find all possible values of $m(A)$, as $A$ varies over all possible $n\times n$ sieves. 

[i]Palmer Mebane[/i]
To find the minimal number of sticks required to partition an \( n \times n \) sieve, we need to consider the properties of the sieve and the sticks. Let's break down the solution step-by-step.

1. **Definition and Initial Observation**:
   - An \( n \times n \) sieve is an \( n \times n \) array with \( n \) cells removed such that exactly one cell is removed from each row and each column.
   - A stick is a \( 1 \times k \) or \( k \times 1 \) array for any positive integer \( k \).

2. **Base Case**:
   - For \( n = 2 \), the sieve is a \( 2 \times 2 \) array with one cell removed from each row and column. The minimal number of sticks required to partition this sieve is \( 2 \). This is because we can use two \( 1 \times 1 \) sticks to cover the remaining two cells.

3. **Inductive Hypothesis**:
   - Assume that for an \( (n-1) \times (n-1) \) sieve, the minimal number of sticks required is \( 2(n-1) - 2 \).

4. **Inductive Step**:
   - Consider an \( n \times n \) sieve. We need to show that the minimal number of sticks required is \( 2n - 2 \).
   - By the inductive hypothesis, an \( (n-1) \times (n-1) \) sieve requires \( 2(n-1) - 2 \) sticks.
   - In the \( n \times n \) sieve, there is at least one removed cell such that there are at least two sticks contained entirely in either the row or column of the removed cell. This is because each row and column must have at least one removed cell, and the remaining cells in that row or column can be covered by sticks.

5. **Combining the Results**:
   - If we remove the row and column containing the removed cell, we are left with an \( (n-1) \times (n-1) \) sieve.
   - By the inductive hypothesis, this \( (n-1) \times (n-1) \) sieve requires \( 2(n-1) - 2 \) sticks.
   - Adding the two sticks required to cover the removed row and column in the \( n \times n \) sieve, we get:
     \[
     2(n-1) - 2 + 2 = 2n - 2
     \]

6. **Conclusion**:
   - Therefore, the minimal number of sticks required to partition an \( n \times n \) sieve is \( 2n - 2 \).

\(\blacksquare\)

The final answer is \( \boxed{ 2n - 2 } \)