Time Limit: 1s
Memory Limit: 512MB
Known: Sn = 1 + 1/2 + 1/3 + ... + 1 / n. Clearly, for any integer K, when n is large enough, Sn is larger than K.
Now given an integer K (1 <= K <= 15),output the smallest n that satisfies Sn > K.
Multiply Cases. For each line, there is an Integer K.
For each test case, you should output the smallest n that satisfies Sn > K.