Shuffle n items uniformly. Return the expected number that end up in their
original position.
Each item stays put with probability , and there are n of them, so the
answer is exactly 1 for every n above zero. A hundred items or a million: the
expected count is still one.
Input
5
Output
1.0