#C14661. Sequence Value Computation

    ID: 44335 Type: Default 1000ms 256MiB

Sequence Value Computation

Sequence Value Computation

You are given a positive integer n. Your task is to compute a value f(n) from a special sequence defined as follows:

\( f(n) = \begin{cases} 1, & \text{if } n=1 \\ n\times (n-1)\times (n+1) = n^3-n, & \text{if } n \ge 2 \end{cases} \)

In addition, you must compute the 6th term of the sequence. That is, f(6).

Input: The program takes input from standard input (stdin). The input consists of a single integer n (1 ≤ n ≤ 106).

Output: The program should output two lines. The first line contains the value of f(n), and the second line contains the value of f(6).

For example, when n = 4, the first output line is computed as:

\( f(4) = 4\times3\times5 = 60 \).

The second line will always be 210 since \( f(6)=6\times5\times7=210 \).

inputFormat

Input from standard input consists of a single integer n.

outputFormat

Output to standard output should contain two lines. The first line is f(n) and the second line is f(6).

## sample
1
1

210

</p>