Problem Description

You're playing a card game as a single player.

There are $N$ cards. The $i$-th card has integer $i$ written on it.

You first shuffle $N$ cards randomly and put them in a pile. Take the card at the top of the pile to your hand. Then repeat the following process until the pile becomes empty:

1. Check the card on the top of the pile.
2. If the number on the card is larger than the number on the last card you took, take the card.
3. Otherwise, discard the card.

The score of the game is the number of cards in your hand at the end. With the given number of cards $N$, what is the expected score of the game?

Input Format

The first line of the input contains the number of test cases, $T$. $T$ lines follow. Each line contains a single integer $N$, the number of cards in the pile.

Output Format

For each test case, output one line containing Case #$x$: $y$, where $x$ is the test case number (starting from $1$) and $y$ is the expected score at the end of the game.

$y$ will be considered correct if it is within an absolute or relative error of $10^{-6}$ of the correct answer.

2
1
2

Case #1: 1.0
Case #2: 1.5

Hint

Limits

$1 \le T \le 100$.

Test Set 1

$1 \le N \le 10$.

Test Set 2

$1 \le N \le 10^6$.

Test Set 3

$1 \le N \le 10^{18}$.