Description

Given: Sn = 1 + 1/2 + 1/3 + … + 1/n. Clearly, for any integer K, when n is sufficiently large, Sn will exceed K.

Now given an integer K (1 ≤ K ≤ 15), compute the smallest n such that Sn > K.

Input Format

A positive integer K.

Output Format

A positive integer n.

```input1 1 ``` ```output1 2 ``` ## Hint

【Data Range】

For 100% of the data, 1 ≤ k ≤ 15.

Source

NOIP2002-J1