Tree Arrangement Problem

Problem Description:

You are given an odd integer \(n\) (with \(3 \leq n \leq 99\)) representing the side length of a square field. Your task is to determine the minimum number of trees that must be planted in the field such that every row and every column contains an even number of trees.

It is guaranteed that the integer provided is odd. Under this constraint, it can be shown that the answer is simply \(n\).

Hint: Since \(n\) is odd, the minimal configuration that satisfies the condition requires planting exactly \(n\) trees.

inputFormat

Input:

A single odd integer \(n\) (where \(3 \leq n \leq 99\)) provided via standard input.

outputFormat

Output:

A single integer representing the minimum number of trees required, printed via standard output.

## sample

3

3

</p>