Maximum Tournament Excitement

This problem asks you to compute the maximum possible total excitement of a knockout tournament with n teams. In the tournament, matches are arranged in an optimal way to maximize the excitement. The excitement of a match is determined by the difference between the competing teams' values, and by pairing the highest ranked team with the lowest ranked team available, one can achieve the maximum excitement.

It can be shown that the maximum total excitement is given by the formula:

[ \left\lfloor \frac{n^2}{4} \right\rfloor ]

Given the number of teams \(n\), your task is to calculate \(\lfloor n^2/4 \rfloor\). For example, when \(n = 5\), the maximum total excitement is \(\lfloor 25/4 \rfloor = 6\).

inputFormat

The input consists of a single line containing one positive integer \(n\), which represents the number of teams in the tournament.

outputFormat

Output a single integer which is the maximum possible total excitement computed as \(\lfloor n^2/4 \rfloor\).

1

0