Solve the following math problem efficiently and clearly:

- For simple problems (2 steps or fewer):
Provide a concise solution with minimal explanation.

- For complex problems (3 steps or more):
Use this step-by-step format:

## Step 1: [Concise description]
[Brief explanation and calculations]

## Step 2: [Concise description]
[Brief explanation and calculations]

...

Regardless of the approach, always conclude with:

Therefore, the final answer is: $oxed{answer}$. I hope it is correct.

Where [answer] is just the final number or expression that solves the problem.

Problem: The squares of a chessboard are labelled with numbers, as shown below.

[asy]
unitsize(0.8 cm);

int i, j;

for (i = 0; i <= 8; ++i) {
  draw((i,0)--(i,8));
  draw((0,i)--(8,i));
}

for (i = 0; i <= 7; ++i) {
for (j = 0; j <= 7; ++j) {
  label("$\frac{1}{" + string(i + 8 - j) + "}$", (i + 0.5, j + 0.5));
}}
[/asy]

Eight of the squares are chosen, so that there is exactly one chosen square in each row and each column.  Find the minimum sum of the labels of the eight chosen squares.
user