CF900D Unusual Sequences

Description

Count the number of distinct sequences $ a_{1},a_{2},...,a_{n} $ ( $ 1

Input Format

N/A

Output Format

N/A

Explanation/Hint

There are three suitable sequences in the first test: $ (3,3,3) $ , $ (3,6) $ , $ (6,3) $ . There are no suitable sequences in the second test.