Consider the ICPC-string as the string consisting of letters ICPC such that any 4 consecutive letters contain two letters C, one letter I and one letter P.
For given n≥4 your task is to find the number of the different ICPC-strings of length n.
Contains one integer n(4≤n≤1000) — the length of the string.
Print one integer — the number of ICPC-strings of length n.