Minimum Harvest Steps

You are given a single integer \(n\) representing the number of trees arranged in a circular formation. You start at tree 1 and need to harvest one fruit from each tree. Since tree 1 is harvested initially without any steps, the minimum number of steps required to harvest the fruits from the remaining trees is \(n - 1\).

Your task is to compute this minimum number of steps.

inputFormat

The input is provided via stdin and consists of a single integer \(n\) (\(n \geq 3\)).

outputFormat

The output should be printed to stdout as a single integer, which is the minimum number of steps required to harvest one fruit from each of the \(n\) trees.

3

2