Problem Statement
Given an integer n, print an n x n box where every row contains the negative numbers from -1 to -n, separated by a single space.
For example, if n = 3, the output should be:
-1 -2 -3
-1 -2 -3
-1 -2 -3
The program must print exactly n lines, and each line must contain exactly n numbers.