Statement

Given: $S_n= 1+\dfrac{1}{2}+\dfrac{1}{3}+…+\dfrac{1}{n}$. Obviously, for any integer $k$, when $n$ is sufficiently large, $S_n>k$.

Given an integer $k$, find the smallest $n$ such that $S_n > k$.

Input

A positive integer $k$, where $1\le k \le 15$.

Output

A positive integer $n$.

Samples

1

2