For a positive integer $n$, consider a square cake which is divided into $n \times n$ pieces with at most one strawberry on each piece. We say that such a cake is [i]delicious[/i] if both diagonals are fully occupied, and each row and each column has an odd number of strawberries.
Find all positive integers $n$ such that there is an $n \times n$ delicious cake with exactly $\left\lceil\frac{n^2}{2}\right\rceil$ strawberries on it.
To solve the problem, we need to find all positive integers \( n \) such that there exists an \( n \times n \) delicious cake with exactly \(\left\lceil\frac{n^2}{2}\right\rceil\) strawberries on it. A cake is considered delicious if both diagonals are fully occupied, and each row and each column has an odd number of strawberries.

### Base Cases:
We start by constructing the base cases for \( n = 5, 6, \) and \( 8 \).

#### Case \( n = 5 \):
The construction is as follows:
\[
\begin{array}{|c|c|c|c|c|}
\hline
\text{S} & 0 & 0 & 0 & \text{S} \\
\hline
0 & \text{S} & 0 & \text{S} & 0 \\
\hline
0 & 0 & \text{S} & 0 & 0 \\
\hline
0 & \text{S} & 0 & \text{S} & 0 \\
\hline
\text{S} & 0 & 0 & 0 & \text{S} \\
\hline
\end{array}
\]
Here, 'S' represents a strawberry. Both diagonals are fully occupied, and each row and column has an odd number of strawberries.

#### Case \( n = 6 \):
The construction is as follows:
\[
\begin{array}{|c|c|c|c|c|c|}
\hline
\text{S} & 0 & 0 & 0 & 0 & \text{S} \\
\hline
0 & \text{S} & 0 & 0 & \text{S} & 0 \\
\hline
0 & 0 & \text{S} & \text{S} & 0 & 0 \\
\hline
0 & 0 & \text{S} & \text{S} & 0 & 0 \\
\hline
0 & \text{S} & 0 & 0 & \text{S} & 0 \\
\hline
\text{S} & 0 & 0 & 0 & 0 & \text{S} \\
\hline
\end{array}
\]
Again, both diagonals are fully occupied, and each row and column has an odd number of strawberries.

#### Case \( n = 8 \):
The construction is as follows:
\[
\begin{array}{|c|c|c|c|c|c|c|c|}
\hline
\text{S} & 0 & 0 & 0 & 0 & 0 & 0 & \text{S} \\
\hline
0 & \text{S} & 0 & 0 & 0 & 0 & \text{S} & 0 \\
\hline
0 & 0 & \text{S} & 0 & 0 & \text{S} & 0 & 0 \\
\hline
0 & 0 & 0 & \text{S} & \text{S} & 0 & 0 & 0 \\
\hline
0 & 0 & 0 & \text{S} & \text{S} & 0 & 0 & 0 \\
\hline
0 & 0 & \text{S} & 0 & 0 & \text{S} & 0 & 0 \\
\hline
0 & \text{S} & 0 & 0 & 0 & 0 & \text{S} & 0 \\
\hline
\text{S} & 0 & 0 & 0 & 0 & 0 & 0 & \text{S} \\
\hline
\end{array}
\]
Both diagonals are fully occupied, and each row and column has an odd number of strawberries.

### Inductive Step:
We will use induction to prove that if there exists a delicious cake for \( n \), then there exists a delicious cake for \( n+2 \) (for odd \( n \)) and \( n+4 \) (for even \( n \)).

#### Induction Hypothesis:
Assume that for some odd \( n \geq 5 \), there exists a delicious \( n \times n \) cake. We need to show that there exists a delicious \( (n+2) \times (n+2) \) cake.

#### Inductive Step for Odd \( n \):
1. Start with the \( n \times n \) delicious cake.
2. Add a border of 1 row and 1 column around the \( n \times n \) cake to form an \( (n+2) \times (n+2) \) cake.
3. Place strawberries on the new border such that both diagonals are fully occupied and each row and column has an odd number of strawberries.

#### Inductive Step for Even \( n \):
1. Start with the \( n \times n \) delicious cake.
2. Add a border of 2 rows and 2 columns around the \( n \times n \) cake to form an \( (n+4) \times (n+4) \) cake.
3. Place strawberries on the new border such that both diagonals are fully occupied and each row and column has an odd number of strawberries.

By induction, we can construct delicious cakes for all \( n \geq 5 \).

\(\blacksquare\)

The final answer is \( \boxed{ n \geq 5 } \).