Problem
Consider N racers of equal ability entering an Olympic event. Clearly the final standing of the top three is important. Write a script which asks the user for how many racers there are (assume the entered number is 3 or greater) and determine the number of possible options for the top 3 (order matters: a-b-c is different from a-c-b). Re-calculate the number of options for the top 3 assuming the top three will have to later re-compete so order did not matter (a-b-c is same as a-c-b).