Total Clock Strikes

In this problem, you are given an integer (n) representing the number of full revolutions of a clock hand. The clock strikes in a peculiar way: its strikes follow the pattern of the sum of the first (n) odd numbers. Using the well-known formula, the total number of strikes is given by (n^2).

For example, if (n = 3), the clock will strike (3^2 = 9) times.

Your task is to compute and output the total strikes when an integer (n) is provided via standard input.

inputFormat

The input consists of a single integer (n) ((1 \leq n \leq 10^6)) read from standard input.

outputFormat

Output a single integer, which is the total number of strikes computed as (n^2), printed to standard output.## sample

1

1