Fractional Sequence

문제

Consider the following increasing sequence, $SS$, of rational numbers: \[ 1, 2, 2\frac{1}{2}, 3, 3\frac{1}{3}, 3\frac{2}{3} , 4, 4\frac{1}{4}, 4\frac{1}{2}, 4\frac{3}{4}, 5, 5\frac{1}{5}, 5\frac{2}{5}, 5\frac{3}{5}, 5\frac{4}{5}, 6, \ldots . \] $SS$ is composed of an infinite set of blocks, $N_1,N_2,N_3,\dots N\_1,\; N\_2,\; N\_3,\; \backslash ldots$, where block $N_{i}N\_i$ is \[ i, i+1/i, i+2/i, \ldots, i+(i-1)/i . \] So $S(1)=1,S(2)=2,S(3)=2\frac{1}{2}S(1)\; =\; 1,\; S(2)\; =\; 2,\; S(3)\; =\; 2\backslash frac\{1\}\{2\}$, etc. Write a program which takes as input an integer $nn$ and outputs $S(n)S(n)$.

입력

Input is a single line containing an integer, $nn$ ($1\le n\le 4\cdot {10}^{9}1\; \backslash leq\; n\; \backslash leq\; 4\backslash cdot\; 10^9$).

출력

Output $S(n)S(n)$ as a single integer if the answer is a whole number. Otherwise, output the integer part, a single space and a proper fraction $a\mathrm{/}ba/b$ in lowest terms (i.e. and $GCD(a,b)=1GCD(a,b)\; =\; 1$). See the sample outputs.