Problem - Beautiful Matrix

You have a $5 \times 5$ matrix filled with $0$s and exactly one $1$. The matrix becomes beautiful when the $1$ is in the center position (row $3$, column $3$). Your task: find the minimum number of adjacent swaps needed to move the $1$ to the center.

This problem tests 2D array traversal and distance calculation. You'll loop through a grid to find a target element, then compute how far it needs to move.

Count the distance.