Consider the ICPC-string as the string consisting of letters ICPC such that any $4$ consecutive letters contain two letters \textbf{C}, one letter \textbf{I} and one letter \textbf{P}. For given $n \ge 4$ your task is to find the number of the different ICPC-strings of length $n$. \InputFile Contains one integer $n\:(4 \le n \le 1000)$ --- the length of the string. \OutputFile Print one integer --- the number of ICPC-strings of length $n$.