ICPC-strings#11308

ICPC-strings

1 second

128 megabytes

Very easy

Define an ICPC-string as a string composed of the letters $I, C, P, C$ I, C, P, C such that every $4$ consecutive characters contain exactly two letters $C$ , one letter $I$ , and one letter $P$ .

For a given $n$ , find the number of distinct ICPC-strings of length $n$ .

Input

Contains one integer $n (4 \leq n \leq 1000)$ n~(4 \le n \le 1000) — the length of the string.

Output

Print one integer — the number of ICPC-strings of length $n$ .

Examples

Example 1

Loading

I, C, P, C

n (4 \leq n \leq 1000)