This problem is a simple version for the task "Cube" from Hacker.org challenges(http://www.hacker.org/challenge).

You have to arrange these wooden pieces to a 4x4x4 cube. Give me the number of all different valid solutions. Two solutions consider different only when one can't perfect match another one with arbitrary rotate. I promise that the answer is smaller than 10^3.