Constructing a Non-Repetitive Sequence

You are given a positive integer n. Your task is to construct a sequence of length n using the characters 'A', 'B', and 'C' such that no two adjacent characters are the same.

The sequence must be constructed by repeating the pattern ABC in order, i.e., the i-th character of the sequence is given by:

\[ S_i = \texttt{ABC}[i \bmod 3] \]

If n is not within the valid range (i.e. if n < 1 or n > 1000), output Not Possible.

Note: Input will be provided via standard input and output should be printed to standard output.

inputFormat

A single integer n on one line (1 ≤ n ≤ 1000). If n is not in this range, the output should be Not Possible.

outputFormat

If n is within the valid range, output the constructed sequence according to the pattern. Otherwise, print Not Possible.

## sample

1

A