Inspired by problem 2175.
A hungry matlab enthusiast has an orange. He decides to cut it into pieces using three dimensional grid.
Given grid density N please help him to find the number of ideal cubes full of juicy orange and the number of pieces containing also some peel.
Example: For N=3 matlab enthusiast is not satisfied. He gets [1 26]. Only one cube and 26 unpeeled pieces!