We can brute force the different permutations of side lengths (there are only 6) of microwaves and check to see how many we can fit in the truck for each orientation. We can get the number of microwaves per dimension by dividing the dimension of the truck by the dimension of a microwave. Divide ~N~ by the maximum number of microwaves that can be fit to get the answer, rounding up the answer if necessary. If the maximum number of microwaves that can be fit is ~0~, then print SCAMMED. Keep in mind that 64-bit integers should be used to compute the solutions, as stated in the problem statement.

Time Complexity: ~\mathcal{O}(1)~