Triangular Numbers

Given a positive integer n (with constraints \(1 \le n \le 100\)), generate the first n triangular numbers. The i-th triangular number is given by the formula:

\(T_i = \frac{i(i+1)}{2}\)

Your task is to compute all triangular numbers from \(T_1\) up to \(T_n\) and output them in order, separated by a single space.

For example, if n is 5, the output should be: 1 3 6 10 15.

inputFormat

The input is provided via standard input. It consists of a single line containing an integer n (\(1 \le n \le 100\)).

outputFormat

Output the first n triangular numbers computed using the formula \(T_i = \frac{i(i+1)}{2}\) for \(i = 1, 2, \ldots, n\). The numbers should be printed in a single line separated by a single space.

## sample

1

1

</p>