Description

Given: $S_n = 1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n}$. It is clear that for any integer $k$, when $n$ is sufficiently large, $S_n$ will exceed $k$.

Given an integer $k$ ($1 \leq k \leq 15$), compute the smallest integer $n$ such that $S_n > k$.

Input Format

An integer $k$.

Output Format

An integer $n$.

1

2